Induced subgraph density. I. A loglog step towards Erdos-Hajnal
Fuente:
arXiv
Saved in:
| Main Authors: | Bucić, Matija, Nguyen, Tung, Scott, Alex, Seymour, Paul |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Induced subgraph density. V. All paths approach Erdos-Hajnal
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Induced subgraph density. VII. The five-vertex path
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Induced subgraph density. VI. Bounded VC-dimension
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures
by: Bucić, Matija, et al.
Published: (2024)
by: Bucić, Matija, et al.
Published: (2024)
Induced subgraph density. II. Sparse and dense sets in cographs
by: Fox, Jacob, et al.
Published: (2023)
by: Fox, Jacob, et al.
Published: (2023)
Induced subgraph density. III. Cycles and subdivisions
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós
by: Bucic, Matija, et al.
Published: (2026)
by: Bucic, Matija, et al.
Published: (2026)
Asymptotic structure. I. Coarse tree-width
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
Asymptotic structure. IV. A counterexample to the weak coarse Menger conjecture
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
Some results and problems on tournament structure
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Trees and near-linear stable sets
by: Nguyen, Tung, et al.
Published: (2024)
by: Nguyen, Tung, et al.
Published: (2024)
Distant digraph domination
by: Nguyen, Tung, et al.
Published: (2024)
by: Nguyen, Tung, et al.
Published: (2024)
Subdivisions and near-linear stable sets
by: Nguyen, Tung, et al.
Published: (2024)
by: Nguyen, Tung, et al.
Published: (2024)
Equiangular lines via improved eigenvalue multiplicity
by: Balla, Igor, et al.
Published: (2024)
by: Balla, Igor, et al.
Published: (2024)
Pivot-minors and the Erdős-Hajnal conjecture
by: Davies, James
Published: (2023)
by: Davies, James
Published: (2023)
Geometric graphs with exponential chromatic number and arbitrary girth
by: Bucić, Matija, et al.
Published: (2023)
by: Bucić, Matija, et al.
Published: (2023)
A counterexample to the coarse Menger conjecture
by: Nguyen, Tung, et al.
Published: (2024)
by: Nguyen, Tung, et al.
Published: (2024)
The vertex sets of subtrees of a tree
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
Line-width and path-width
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
Erdős-Hajnal problems for posets
by: Winter, Christian
Published: (2023)
by: Winter, Christian
Published: (2023)
A problem of Erdős and Hajnal on paths with equal-degree endpoints
by: Chen, Kaizhe, et al.
Published: (2025)
by: Chen, Kaizhe, et al.
Published: (2025)
Asymptotic structure. II. Path-width and additive quasi-isometry
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
Counting independent sets in structured graphs
by: Bucić, Matija, et al.
Published: (2024)
by: Bucić, Matija, et al.
Published: (2024)
Asymptotic structure. VI. Distant paths across a disc
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints
by: Zhao, Xiamiao, et al.
Published: (2026)
by: Zhao, Xiamiao, et al.
Published: (2026)
A complement of the Erdős-Hajnal problem on paths with equal-degree endpoints
by: Liu, Zhen, et al.
Published: (2025)
by: Liu, Zhen, et al.
Published: (2025)
Asymptotic structure. III. Excluding a fat tree
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
On a problem of Erdos and Hajnal
by: Garti, Shimon, et al.
Published: (2025)
by: Garti, Shimon, et al.
Published: (2025)
A step towards the Erdős-Rogers problem
by: Du, Longma, et al.
Published: (2026)
by: Du, Longma, et al.
Published: (2026)
Unit and distinct distances in typical norms
by: Alon, Noga, et al.
Published: (2023)
by: Alon, Noga, et al.
Published: (2023)
Two Erdos-Hajnal-type theorems for forbidden order-size pairs
by: Arnold, Fabian, et al.
Published: (2024)
by: Arnold, Fabian, et al.
Published: (2024)
Intersecting hypergraphs with large cover number
by: Bucić, Matija, et al.
Published: (2025)
by: Bucić, Matija, et al.
Published: (2025)
A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
by: Fu, Yayi
Published: (2023)
by: Fu, Yayi
Published: (2023)
The power of many colours
by: Alon, Noga, et al.
Published: (2023)
by: Alon, Noga, et al.
Published: (2023)
Topological Minors in Typical Lifts
by: Bucić, Matija, et al.
Published: (2024)
by: Bucić, Matija, et al.
Published: (2024)
Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)
by: Gishboliner, Lior, et al.
Published: (2024)
Similar Items
-
Induced subgraph density. V. All paths approach Erdos-Hajnal
by: Nguyen, Tung, et al.
Published: (2023) -
Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
by: Nguyen, Tung, et al.
Published: (2023) -
Induced subgraph density. VII. The five-vertex path
by: Nguyen, Tung, et al.
Published: (2023) -
Induced subgraph density. VI. Bounded VC-dimension
by: Nguyen, Tung, et al.
Published: (2023) -
Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures
by: Bucić, Matija, et al.
Published: (2024)