The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor

DOI10.37236/9536zbMath1461.05143arXiv2003.12960OpenAlexW3012954974MaRDI QIDQ2662350

Sang-il Oum, Jae-Hoon Kim

Publication date: 12 April 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.12960

zbMATH Keywords

Erdős-Hajnal conjecturevertex-minors

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Classes of graphs with small rank decompositions are \(\chi \)-bounded
• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
• Ramsey-type theorems
• Recent developments on graphs of bounded clique-width
• On universality of graphs with uniformly distributed edges
• Vertex-minors and the Erdős-Hajnal conjecture
• The grid theorem for vertex-minors
• Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
• Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• Crossing patterns of semi-algebraic sets
• Vizing bound for the chromatic number on some graph classes
• The Erdös--Hajnal Conjecture for Long Holes and Antiholes
• The Erdös-Hajnal Conjecture-A Survey
• Excluding a bipartite circle graph from line graphs
• A survey of χ‐boundedness
• Induced Ramsey-type theorems

This page was built for publication: The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor