Non-Bipartite K-Common Graphs
Typ dokumentu
článek v časopisejournal article
Peer-reviewed
acceptedVersion
Autor
Kráľ D.
Noel J.A.
Norin S.
Volec J.
Wei F.
Práva
openAccessMetadata
Zobrazit celý záznamAbstrakt
In this work, we construct the first examples of non-bipartite k-common graphs for k at least 3, which resolves a problem of Jagger, Stovícek and Thomason from 1996. A graph H is said to be "k-common" if the number of monochromatic copies of H in a k-coloring of the edges of an n-vertex complete graph is asymptotically minimized by a random coloring. Note that the case k=2 coincides with the notion of common graphs introduced in 1960s.
Zobrazit/ otevřít
Kolekce
- Publikační činnost ČVUT [1323]