Pages that link to "Item:Q2566809"
From MaRDI portal
The following pages link to Crossing patterns of semi-algebraic sets (Q2566809):
Displaying 50 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- Ramsey-Turán numbers for semi-algebraic graphs (Q668033) (← links)
- Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Semi-algebraic Ramsey numbers (Q896011) (← links)
- Points with large \(\alpha \)-depth (Q1024376) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
- Independent sets in algebraic hypergraphs (Q2119362) (← links)
- The Schur-Erdős problem for semi-algebraic colorings (Q2204399) (← links)
- Pure pairs. I: Trees and linear anticomplete pairs (Q2213783) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- An extension of a theorem of Yao and Yao (Q2250045) (← links)
- The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Homogeneous selections from hyperplanes (Q2434718) (← links)
- Nearly equal distances and Szemerédi's regularity lemma (Q2489544) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- A note on “Regularity lemma for distal structures” (Q2809212) (← links)
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes (Q2813338) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Overlap properties of geometric expanders (Q3168403) (← links)
- Ramsey-type results for semi-algebraic relations (Q3190741) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Pure Pairs VI: Excluding an Ordered Tree (Q5020840) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)
- (Q5088966) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- RAMSEY GROWTH IN SOME NIP STRUCTURES (Q5147670) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Helly-type problems (Q5868651) (← links)
- Induced Ramsey-type theorems (Q5900433) (← links)
- Pure pairs. IV: Trees in bipartite graphs (Q6038584) (← links)
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs (Q6051048) (← 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)
