Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 94
Number of items: 94
  • Schrijver, A. (2023). On the Shannon capacity of sums and products of graphs. Indagationes Mathematicae, 34(1), 37-41. https://doi.org/10.1016/J.INDAG.2022.08.009
  • Polak, S. C., & Schrijver, A. (2019). New lower bound on the Shannon capacity of C7 from circular graphs. Information Processing Letters, 143, 37-40. https://doi.org/10.1016/j.ipl.2018.11.006
  • Open Access
    Alberts, G., Koetsier, T., van Mill, J., & Schrijver, A. (2019). Erudiet Wiskundige: In Memoriam Pieter Cornelis Baayen (1934-2019). Nieuw Archief voor Wiskunde, 5/20(4), 287-289. http://www.nieuwarchief.nl/serie5/toonnummer.php?deel=20&nummer=4&taal=0
  • Open Access
    Polak, S. C. (2019). New methods in coding theory: Error-correcting codes and the Shannon capacity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Litjens, B. M. (2019). Applications of representation theory in discrete mathematics. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Sevenster, B. L. (2018). New characterizations of partition functions using connection matrices. [Thesis, fully internal, Universiteit van Amsterdam].
  • Regts, G., Schrijver, A., & Sevenster, B. (2017). On the existence of real R-matrices for virtual link invariants. Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 87(2), 435-443. https://doi.org/10.1007/s12188-016-0175-9
  • Schrijver, A., & Sevenster, B. (2017). The Strong Arnold Property for 4-connected flat graphs. Linear Algebra and Its Applications, 522, 153-160. https://doi.org/10.1016/j.laa.2017.02.002
  • Lovász, L., & Schrijver, A. (2017). Nullspace embeddings for outerplanar graphs. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.), A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek (pp. 571-591). Springer. https://doi.org/10.1007/978-3-319-44479-6_23
  • Open Access
    Litjens, B., Polak, S., & Schrijver, A. (2017). Semidefinite bounds for nonbinary codes based on quadruples. Designs, Codes and Cryptography, 84(1-2), 87-100. https://doi.org/10.1007/s10623-016-0216-5
Page 1 of 10