Recommendations
Cites work
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3989345 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- scientific article; zbMATH DE number 1552836 (Why is no real title available?)
- scientific article; zbMATH DE number 1405805 (Why is no real title available?)
- scientific article; zbMATH DE number 2196516 (Why is no real title available?)
- scientific article; zbMATH DE number 5035595 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- A Ramsey-Type Result for Convex Sets
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- A decomposition theorem for partially ordered sets
- Crossing patterns of segments
- Crossing patterns of semi-algebraic sets
- Cubic Ramanujan graphs
- Eigenvalues and expanders
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Geometric graphs with few disjoint edges
- Good splitters for counting points in triangles
- On a property of the class of n-colorable graphs
- Ramanujan graphs
- Ramsey graphs cannot be defined by real polynomials
- Simulating independence
- Some geometric applications of Dilworth's theorem
- The strong perfect graph theorem
- The structure of Sperner k-families
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(32)- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
- Improved Ramsey-type results for comparability graphs
- Two-Sided, Unbiased Version of Hall’s Marriage Theorem
- A separator theorem for string graphs and its applications
- Ordered graphs and large bi-cliques in intersection graphs of curves
- A Separator Theorem for String Graphs and Its Applications
- Turán-type results for partial orders and intersection graphs of convex sets
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Pure pairs. VI: Excluding an ordered tree
- Bouquet and join theorems for disentanglements
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- A bipartite separable ball and its applications
- Bipartite-ness under smooth conditions
- Strong Erdős-Hajnal properties in chordal graphs
- Bipartite sets of spheres and Casey-type theorems
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
- Applications of a new separator theorem for string graphs
- Excluding hooks and their complements
- A bipartite strengthening of the crossing Lemma
- A Bipartite Strengthening of the Crossing Lemma
- String graphs and incomparability graphs
- Erdős-Hajnal-type results for monotone paths
- A proof of McKee's Eulerian-bipartite characterization
- The reversal ratio of a poset.
- A sharp threshold phenomenon in string graphs
- Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
- Clique-stable set separation in perfect graphs with no balanced skew-partitions
- Pure pairs. II: Excluding all subdivisions of a graph
- Dichotomy result on 3-regular bipartite non-negative functions
- On multipartite posets
- String graphs have the Erdős-Hajnal property
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)
