Pages that link to "Item:Q958690"

The following pages link to The Erdős-Hajnal conjecture for bull-free graphs (Q958690):

Displaying 33 items.

• Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
• Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
• Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
• Excluding paths and antipaths (Q520043) (← links)
• Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
• Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters (Q765202) (← links)
• The structure of bull-free graphs II and III -- a summary (Q765203) (← links)
• Excluding hooks and their complements (Q1671647) (← links)
• The Doyen-Wilson theorem for bull designs (Q1937562) (← links)
• Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
• Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
• The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
• Erdős-Lovász Tihany conjecture for graphs with forbidden holes (Q2312803) (← links)
• Disjoint induced subgraphs of the same order and size (Q2349965) (← links)
• Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
• The Erdős-Hajnal conjecture for long holes and antiholes (Q2813338) (← links)
• Some properties of edge intersection graphs of single bend paths on a grid (Q2851434) (← links)
• The Erdős-Hajnal conjecture. A survey (Q2874098) (← links)
• Excluding induced subdivisions of the bull and related graphs (Q2911052) (← links)
• Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement (Q2911494) (← links)
• For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050) (← links)
• Erdos-Hajnal conjecture for graphs with bounded VC-dimension (Q4580118) (← links)
• Metrically homogeneous graphs of diameter 3 (Q4991900) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• (Q5874504) (← links)
• Induced Ramsey-type theorems (Q5900433) (← 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)
• The regularity of almost all edge ideals (Q6187710) (← links)
• Graphs of large chromatic number (Q6198641) (← links)