scientific article; zbMATH DE number 1552836
From MaRDI portal
Publication:4525053
Recommendations
- A set intersection theorem and an application to a bipartite Ramsey theorem
- Ramsey-type results for geometric graphs. I
- Density theorems for bipartite graphs and related Ramsey-type results
- Turán-type results for partial orders and intersection graphs of convex sets
- On Ramsey graphs without bipartite subgraphs
Cited in
(32)- A bipartite analogue of Dilworth's theorem for multiple partial orders
- A Ramsey theorem for countable homogeneous directed graphs
- Excluding hooks and their complements
- Free energy in the Potts spin Glass
- Erdős-Hajnal-type results for monotone paths
- The Erdős-Hajnal conjecture for paths and antipaths
- Crossing patterns of semi-algebraic sets
- On edge-ordered Ramsey numbers
- Identifying codes in hereditary classes of graphs and VC-dimension
- scientific article; zbMATH DE number 3910431 (Why is no real title available?)
- Asymptotic Size Ramsey Results for Bipartite Graphs
- Bipartite independence number in graphs with bounded maximum degree
- Ramsey properties of algebraic graphs and hypergraphs
- Two complexity results for the vertex coloring problem
- scientific article; zbMATH DE number 7144854 (Why is no real title available?)
- Induced Ramsey-type theorems
- Crossing patterns of segments
- A set intersection theorem and an application to a bipartite Ramsey theorem
- Pure pairs. IV: Trees in bipartite graphs
- Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- Turán-type results for partial orders and intersection graphs of convex sets
- Extremal bipartite independence number and balanced coloring
- Free energy upper bound for mean-field vector spin glasses
- Pure Pairs. IX. Transversal Trees
- Graphs of large chromatic number
- Strong Erdős-Hajnal properties in chordal graphs
- Induced Turán problem in bipartite graphs
- Low-rank matrix estimation with inhomogeneous noise
- Erdős-Hajnal-type theorems in hypergraphs
- A bipartite analogue of Dilworth's theorem
- Density theorems for bipartite graphs and related Ramsey-type results
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525053)
