Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Peter M. Kosek"'
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Comment: 9 pages
Comment: 9 pages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a28f0235aef6bef8e0b8a5cfd650694c
Publikováno v:
ACM Transactions on Algorithms; Jun2021, Vol. 17 Issue 3, p1-51, 51p
