Erdos hajnal conjecture
由 M Chudnovsky 著作 · 2013 · 被引用 113 次 — It is a well-known theorem of Erdös [13] that there exist graphs on n vertices, with no clique or stable set of size larger than O(log n). ,由 M Chudnovsky 著作 · 2016 — Abstract:The Erdös-Hajnal conjecture states that for every graph H, there exists a constant -delta(H) > 0 such that every graph G with no ...
| 相關軟體 Write! 資訊 | |
|---|---|
 Erdos hajnal conjecture 相關參考資料
Erdős–Hajnal conjecture
In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large ... https://en.wikipedia.org The Erdös-Hajnal Conjecture—A Survey
由 M Chudnovsky 著作 · 2013 · 被引用 113 次 — It is a well-known theorem of Erdös [13] that there exist graphs on n vertices, with no clique or stable set of size larger than O(log n). https://web.math.princeton.edu [1606.08827] The Erdös-Hajnal Conjecture---A Survey
由 M Chudnovsky 著作 · 2016 — Abstract:The Erdös-Hajnal conjecture states that for every graph H, there exists a constant -delta(H) > 0 such that every graph G with no ... https://arxiv.org [2305.09133] Pivot-minors and the Erdős-Hajnal conjecture
由 J Davies 著作 · 2023 · 被引用 3 次 — Abstract:We prove a conjecture of Kim and Oum that every proper pivot-minor-closed class of graphs has the strong Erdős-Hajnal property. https://arxiv.org [gt.go] - "Recent progress on the Erdos-Hajnal conjecture" ...
2024年5月3日 — The EH-conjecture says that for every hereditary class of graphs (except the class of all graphs), there exists c>0 such that every graph G in ... https://www.labri.fr Erdös–Hajnal conjecture for new infinite families of ...
由 S Zayat 著作 · 2023 · 被引用 6 次 — This conjecture is known to hold for a few infinite families of tournaments. In this article we construct two new infinite families of ... https://onlinelibrary.wiley.co Forbidding Couples of Tournaments and the Erdös–Hajnal ...
由 S Zayat 著作 · 2023 · 被引用 2 次 — In this paper we construct two infinite families of tournaments for which the conjecture is still open for infinitely many tournaments in these ... https://link.springer.com The Erdös–Hajnal Conjecture—A Survey
The Erdös–Hajnal conjecture states that for every graph H, there exists a constant such that every graph G with no induced subgraph isomorphic to H has ... https://www.researchgate.net On the Erdos-Hajnal conjecture for six-vertex tournaments
由 E Berger 著作 · 被引用 15 次 — The conjecture has a directed equivalent version stating that for every tournament H there exists (H) > 0 such that every H-free n-vertex tournament T contains ... https://research.google The Erdős-Hajnal Conjecture
2020年11月26日 — H-free graphs (Erdős, Hajnal 1989). For every graph H, there exists a constant c(H) > 0 s.t. every H-free graph G with n vertices. https://tcs.uj.edu.pl |