A bipartite analogue of Dilworth's theorem
From MaRDI portal
Publication:862983
DOI10.1007/S11083-006-9043-ZzbMATH Open1108.06002OpenAlexW2039857505MaRDI QIDQ862983FDOQ862983
Authors: Jacob Fox 
Publication date: 25 January 2007
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-006-9043-z
Recommendations
Cites Work
- Eigenvalues and expanders
- Crossing patterns of semi-algebraic sets
- The strong perfect graph theorem
- Ramanujan graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cubic Ramanujan graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- A decomposition theorem for partially ordered sets
- The structure of Sperner k-families
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Ramsey-Type Result for Convex Sets
- On a property of the class of n-colorable graphs
- Some geometric applications of Dilworth's theorem
- Geometric graphs with few disjoint edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Crossing patterns of segments
- Simulating independence
- Good splitters for counting points in triangles
- Ramsey graphs cannot be defined by real polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (32)
- Pure pairs. II: Excluding all subdivisions of a graph
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Clique-stable set separation in perfect graphs with no balanced skew-partitions
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- A bipartite strengthening of the crossing Lemma
- Strong Erdős-Hajnal properties in chordal graphs
- String graphs and incomparability graphs
- Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
- Improved Ramsey-type results for comparability graphs
- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
- Turán-type results for partial orders and intersection graphs of convex sets
- Erdős-Hajnal-type results for monotone paths
- A Bipartite Strengthening of the Crossing Lemma
- A proof of McKee's Eulerian-bipartite characterization
- A separator theorem for string graphs and its applications
- Applications of a new separator theorem for string graphs
- The reversal ratio of a poset.
- String graphs have the Erdős-Hajnal property
- Pure Pairs VI: Excluding an Ordered Tree
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
- On multipartite posets
- Dichotomy result on 3-regular bipartite non-negative functions
- Bipartite-ness under smooth conditions
- Excluding hooks and their complements
- Two-Sided, Unbiased Version of Hall’s Marriage Theorem
- A sharp threshold phenomenon in string graphs
- Ordered graphs and large bi-cliques in intersection graphs of curves
- A Separator Theorem for String Graphs and Its Applications
- A bipartite separable ball and its applications
- Bouquet and join theorems for disentanglements
- Bipartite sets of spheres and Casey-type theorems
This page was built for publication: A bipartite analogue of Dilworth's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862983)
