Strong Erdős-Hajnal properties in chordal graphs
From MaRDI portal
Publication:6574376
Recommendations
Cites work
- scientific article; zbMATH DE number 1552836 (Why is no real title available?)
- scientific article; zbMATH DE number 1786524 (Why is no real title available?)
- A Ramsey-Type Result for Convex Sets
- A bipartite analogue of Dilworth's theorem
- Crossing patterns of segments
- Crossing patterns of semi-algebraic sets
- Erdős-Hajnal-type results on intersection patterns of geometric objects
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- Overlap properties of geometric expanders
- Pure pairs. I: Trees and linear anticomplete pairs
- Pure pairs. II: Excluding all subdivisions of a graph
- Pure pairs. IV: Trees in bipartite graphs
- Ramsey-type theorems
- Representation of a finite graph by a set of intervals on the real line
- Some remarks on the theory of graphs
- The Erdős-Hajnal conjecture for long holes and antiholes
- The Erdős-Hajnal conjecture. A survey
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The strong perfect graph theorem
- Turán-type results for partial orders and intersection graphs of convex sets
- Über das Problem der Nachbargebiete im Raum.
This page was built for publication: Strong Erdős-Hajnal properties in chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574376)