Spectral extrema of graphs: Forbidden hexagon
To determine the Turán numbers of even cycles is a central problem of extremal graph theory. Even for C6, the Turán number is still open. Till now, the best known upper bound is given by Füredi, Naor and Verstraëte [On the Turán number for the hexagon, Advances in Math.]. In 2010, Nikiforov posed a...
Saved in:
Published in | Discrete mathematics Vol. 343; no. 10; p. 112028 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.10.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!