Pages that link to "Item:Q5955193"

The following pages link to Ramsey-type theorems with forbidden subgraphs (Q5955193):

Displaying 50 items.

• On high-dimensional acyclic tournaments (Q393743) (← links)
• Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
• Tournaments with near-linear transitive subsets (Q462934) (← links)
• Excluding paths and antipaths (Q520043) (← links)
• A tournament approach to pattern avoiding matrices (Q522321) (← 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)
• Connected obstructions to full graph homomorphisms (Q740288) (← links)
• The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
• Dualities in full homomorphisms (Q1041189) (← links)
• Problems and results in extremal combinatorics. I. (Q1417566) (← links)
• On the Erdős-Hajnal conjecture for six-vertex tournaments (Q1621068) (← links)
• Excluding hooks and their complements (Q1671647) (← links)
• Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
• Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
• Tournaments and the strong Erdős-Hajnal property (Q2065123) (← links)
• Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
• Two Erdős-Hajnal-type theorems in hypergraphs (Q2221933) (← links)
• Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
• The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
• Coloring tournaments: from local to global (Q2312616) (← links)
• Forcing large transitive subtournaments (Q2343283) (← links)
• The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
• EH-suprema of tournaments with no nontrivial homogeneous sets (Q2349509) (← links)
• Erdős--Szekeres theorem with forbidden order types (Q2368653) (← links)
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
• Near-domination in graphs (Q2424917) (← links)
• Crossing patterns of semi-algebraic sets (Q2566809) (← links)
• Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
• Forbidding couples of tournaments and the Erdös-Hajnal conjecture (Q2701398) (← links)
• The Erdös--Hajnal Conjecture for Long Holes and Antiholes (Q2813338) (← links)
• Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
• Upper Bounds for Erdös-Hajnal Coefficients of Tournaments (Q2852616) (← links)
• The Erdös-Hajnal Conjecture-A Survey (Q2874098) (← 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)
• Structure Theorem for<i>U</i>₅-free Tournaments (Q2940986) (← links)
• Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284) (← links)
• Acyclic subgraphs of tournaments with high chromatic number (Q4999677) (← links)
• Pure Pairs VI: Excluding an Ordered Tree (Q5020840) (← links)
• Induced Ramsey-type theorems (Q5900433) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• About the Erdős-Hajnal conjecture for seven-vertex tournaments (Q6056460) (← links)
• Erdős–Hajnal for graphs with no 5‐hole (Q6075068) (← links)
• Pure pairs. X. Tournaments and the strong Erdős-Hajnal property (Q6081115) (← links)
• Erdös–Hajnal conjecture for new infinite families of tournaments (Q6093157) (← 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)
• Forests and the strong Erdős-Hajnal property (Q6204336) (← links)