Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Craig Weidert"'
Publikováno v:
Journal of Combinatorial Theory, Series A. 165:32-43
An ordered graph H is a graph with a linear ordering on its vertex set. The corresponding Turan problem, first studied by Pach and Tardos, asks for the maximum number ex ( n , H ) of edges in an ordered graph on n vertices that does not contain H as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1595abec9bb854ff2e2041ea75d1ccee
https://doi.org/10.1016/j.jcta.2019.01.006
https://doi.org/10.1016/j.jcta.2019.01.006
