The following pages link to (Q3509401):
Displaying 22 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- Pure pairs. I: Trees and linear anticomplete pairs (Q2213783) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes (Q2813338) (← links)
- Graphs with Large Obstacle Numbers (Q3057633) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Pure Pairs VI: Excluding an Ordered Tree (Q5020840) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)
- RAMSEY GROWTH IN SOME NIP STRUCTURES (Q5147670) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Pure pairs. IV: Trees in bipartite graphs (Q6038584) (← links)
- Erdős–Hajnal for graphs with no 5‐hole (Q6075068) (← links)
- Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs (Q6138779) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
