Strong Erdős-Hajnal properties in chordal graphs
From MaRDI portal
Publication:6574376
DOI10.37236/12111zbMATH Open1543.05145MaRDI QIDQ6574376FDOQ6574376
Authors: Min Ho Cho, Andreas Holmsen, Jinha Kim, Min-Ki Kim 
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- Crossing patterns of semi-algebraic sets
- The Erdős-Hajnal conjecture. A survey
- Erdős-Hajnal-type results on intersection patterns of geometric objects
- Some remarks on the theory of graphs
- The strong perfect graph theorem
- A bipartite analogue of Dilworth's theorem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Overlap properties of geometric expanders
- Ramsey-type theorems
- A Ramsey-Type Result for Convex Sets
- Turán-type results for partial orders and intersection graphs of convex sets
- Title not available (Why is that?)
- Crossing patterns of segments
- Über das Problem der Nachbargebiete im Raum.
- The Erdős-Hajnal conjecture for long holes and antiholes
- Pure pairs. II: Excluding all subdivisions of a graph
- Pure pairs. I: Trees and linear anticomplete pairs
- Pure pairs. IV: Trees in bipartite graphs
- Title not available (Why is that?)
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)
