Imagen de Portada

Induced subgraph density. V. All paths approach Erdos-Hajnal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nguyen, Tung, Scott, Alex, Seymour, Paul
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Induced subgraph density. I. A loglog step towards Erdos-Hajnal
por: Bucić, Matija, et al.
Publicado: (2023)

Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
por: Nguyen, Tung, et al.
Publicado: (2023)

Induced subgraph density. VII. The five-vertex path
por: Nguyen, Tung, et al.
Publicado: (2023)

Induced subgraph density. VI. Bounded VC-dimension
por: Nguyen, Tung, et al.
Publicado: (2023)

Induced subgraph density. II. Sparse and dense sets in cographs
por: Fox, Jacob, et al.
Publicado: (2023)

Induced subgraph density. III. Cycles and subdivisions
por: Nguyen, Tung, et al.
Publicado: (2023)

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
por: Nguyen, Tung, et al.
Publicado: (2025)

Line-width and path-width
por: Nguyen, Tung, et al.
Publicado: (2025)

Asymptotic structure. VI. Distant paths across a disc
por: Nguyen, Tung, et al.
Publicado: (2025)

A problem of Erdős and Hajnal on paths with equal-degree endpoints
por: Chen, Kaizhe, et al.
Publicado: (2025)

Some results and problems on tournament structure
por: Nguyen, Tung, et al.
Publicado: (2023)

Trees and near-linear stable sets
por: Nguyen, Tung, et al.
Publicado: (2024)

Distant digraph domination
por: Nguyen, Tung, et al.
Publicado: (2024)

Asymptotic structure. IV. A counterexample to the weak coarse Menger conjecture
por: Nguyen, Tung, et al.
Publicado: (2025)

Subdivisions and near-linear stable sets
por: Nguyen, Tung, et al.
Publicado: (2024)

Asymptotic structure. I. Coarse tree-width
por: Nguyen, Tung, et al.
Publicado: (2025)

A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints
por: Zhao, Xiamiao, et al.
Publicado: (2026)

A complement of the Erdős-Hajnal problem on paths with equal-degree endpoints
por: Liu, Zhen, et al.
Publicado: (2025)

Pivot-minors and the Erdős-Hajnal conjecture
por: Davies, James
Publicado: (2023)

The vertex sets of subtrees of a tree
por: Chudnovsky, Maria, et al.
Publicado: (2025)

A counterexample to the coarse Menger conjecture
por: Nguyen, Tung, et al.
Publicado: (2024)

Erdős-Hajnal problems for posets
por: Winter, Christian
Publicado: (2023)

Asymptotic structure. II. Path-width and additive quasi-isometry
por: Nguyen, Tung, et al.
Publicado: (2025)

Graphs without a 3-connected subgraph are 4-colorable
por: Bonnet, Édouard, et al.
Publicado: (2024)

Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures
por: Bucić, Matija, et al.
Publicado: (2024)

Asymptotic structure. III. Excluding a fat tree
por: Nguyen, Tung, et al.
Publicado: (2025)

On a problem of Erdos and Hajnal
por: Garti, Shimon, et al.
Publicado: (2025)

Two Erdos-Hajnal-type theorems for forbidden order-size pairs
por: Arnold, Fabian, et al.
Publicado: (2024)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
por: Gishboliner, Lior, et al.
Publicado: (2024)

Rainbow triangles and the Erdős-Hajnal problem in projective geometries
por: Chun, Carolyn, et al.
Publicado: (2025)

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
por: Fu, Yayi
Publicado: (2023)

On problems of Erdős and Baumann-Briggs on minimising the density of $s$-cliques in graphs with forbidden subgraphs
por: Bodnár, Levente, et al.
Publicado: (2026)

Toward a density Corrádi--Hajnal theorem for degenerate hypergraphs
por: Hou, Jianfeng, et al.
Publicado: (2023)

Pure pairs. IX. Transversal trees
por: Scott, Alex, et al.
Publicado: (2021)

Forbidden subgraphs in divisor graphs and an Erdős divisibility problem
por: Davis, Damek
Publicado: (2026)

The Hajnal--Rothschild problem
por: Frankl, Peter, et al.
Publicado: (2025)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
por: Balister, Paul, et al.
Publicado: (2025)

An Erdős-Ko-Rado type theorem for subgraphs of perfect matchings
por: Nagy, Dániel T.
Publicado: (2024)

Induced subgraphs and tree decompositions V. One neighbor in a hole
por: Abrishami, Tara, et al.
Publicado: (2022)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
por: Tung Nguyen, et al.
Publicado: (2024)