scientific article; zbMATH DE number 970798

MaRDI QIDQ5689002zbMATH OpenFDO

Authors András Gyárfás

Publication date 11 March 1997

zbMATH Keywords

Erdös-Hajnal problemindependent set

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• The Erdős-Hajnal conjecture. A survey
• Almost all H-free graphs have the Erdős-Hajnal property
• The Erdős-Hajnal conjecture for long holes and antiholes
• Erdős-Hajnal-type results on intersection patterns of geometric objects
• The Erdős-Hajnal conjecture for paths and antipaths

Cited in

(20)

• Graphs in which each \(C_4\) spans \(K_4\)
• Erdős--Szekeres theorem with forbidden order types
• Crossing patterns of semi-algebraic sets
• The Erdős-Hajnal conjecture for long holes and antiholes
• A taste for duality: Erdős, Dilworth, Gallai, Milgram, and Mirsky
• Induced C₅-free graphs of fixed density: counting and homogeneous sets
• The Erdős-Hajnal conjecture. A survey
• Almost all H-free graphs have the Erdős-Hajnal property
• Sur un Probleme D'Erdös Et Hajnal
• Erdős-Hajnal-type results on intersection patterns of geometric objects
• Excluding paths and antipaths
• Strong cliques in diamond-free graphs
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Erdős–Hajnal for graphs with no 5‐hole
• Towards the Erdős-Hajnal conjecture for P₅-free graphs
• Graphs of large chromatic number
• Induced subgraph density. VII: The five-vertex path
• Induced subgraph density. VI: Bounded VC-dimension
• Graph theory. Abstracts from the workshop held January 5--10, 2025
• The Erdős-Hajnal conjecture for bull-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689002)