On the public citation graph

Some geometric applications of Dilworth’s theorem

https://doi.org/10.1007/bf02574361
0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/bf01305948openalex-snapshot
Bounding the vertex cover number of a hypergraph
inferredcites →https://doi.org/10.1007/bf02187731openalex-snapshot
Disjoint edges in geometric graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90045-7openalex-snapshot
Covering and coloring problems for relatives of intervals
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1112/blms/26.2.132openalex-snapshot
A Ramsey-Type Result for Convex Sets
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/2305092openalex-snapshot
On Sets of Distances of n Points

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/jgt.22601openalex-snapshot
A survey of χ‐boundedness
inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferred← citeshttps://doi.org/10.1006/jcta.1999.3001openalex-snapshot
Note on Geometric Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_31openalex-snapshot
Unavoidable Configurations in Complete Topological Graphs
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_63openalex-snapshot
Graph drawing with no k pairwise crossing edges
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_15openalex-snapshot
On Disjoint Crossing Families in Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_26openalex-snapshot
A Note on Geometric 3-Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8openalex-snapshot
Algorithms and Discrete Applied Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_19openalex-snapshot
Coloring Hasse Diagrams and Disjointness Graphs of Curves
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_7openalex-snapshot
Nonplanar Graph Drawings with k Vertices per Face
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_15openalex-snapshot
Disjoint Edges in Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77200-2_4openalex-snapshot
Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_4openalex-snapshot
Tangled Thrackles
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_32openalex-snapshot
Density Theorems for Intersection Graphs of t-Monotone Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/bf00676234openalex-snapshot
Symmetric chain partitions of orthocomplemented posets
inferred← citeshttps://doi.org/10.1007/bf01844847openalex-snapshot
On point covers of multiple intervals and axis-parallel rectangles
inferred← citeshttps://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferred← citeshttps://doi.org/10.1007/bfb0009486openalex-snapshot
Extremal problems for geometric hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0021830openalex-snapshot
Crossing numbers of meshes
inferred← citeshttps://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferred← citeshttps://doi.org/10.1007/pl00009482openalex-snapshot
Geometric Graphs with Few Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00373-007-0720-5openalex-snapshot
Jin Akiyama: A Friend and His Mathematics
inferred← citeshttps://doi.org/10.1007/s00373-022-02563-2openalex-snapshot
Disjoint Edges in Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s003730200017openalex-snapshot
Ramsey-Type Results for Unions of Comparability Graphs
inferred← citeshttps://doi.org/10.1007/s00454-005-1191-1openalex-snapshot
Geometric Graphs with No Three Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00454-009-9202-2openalex-snapshot
Segment Orders
inferred← citeshttps://doi.org/10.1007/s00454-022-00438-0openalex-snapshot
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons
inferred← citeshttps://doi.org/10.1007/s11083-006-9043-zopenalex-snapshot
A Bipartite Analogue of Dilworth’s Theorem
inferred← citeshttps://doi.org/10.1007/s11083-015-9384-6openalex-snapshot
Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs
inferred← citeshttps://doi.org/10.1007/s11083-025-09722-zopenalex-snapshot
A Multipartite Analogue of Dilworth’s Theorem
inferred← citeshttps://doi.org/10.1007/s11856-010-0056-3openalex-snapshot
Turán-type results for partial orders and intersection graphs of convex sets
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00107-topenalex-snapshot
Problems and results in discrete mathematics
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.003openalex-snapshot
On the chromatic number of some geometric type Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.12.001openalex-snapshot
Independent set of intersection graphs of convex objects in 2D
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.02.003openalex-snapshot
On grids in topological graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.12.004openalex-snapshot
A bipartite analogue of Dilworth’s theorem for multiple partial orders
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.021openalex-snapshot
Coloring K k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.060openalex-snapshot
On disjoint crossing families in geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.11.001openalex-snapshot
Triangle-free intersection graphs of line segments with large chromatic number
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.02.003openalex-snapshot
On the chromatic number of disjointness graphs of curves
inferred← citeshttps://doi.org/10.1017/9781009701259.027openalex-snapshot
A Long Noncrossing Path Among Disjoint Segments in the Plane
inferred← citeshttps://doi.org/10.1017/s0963548320000103openalex-snapshot
Improved Ramsey-type results for comparability graphs
inferred← citeshttps://doi.org/10.1109/access.2024.3401078openalex-snapshot
Graphs Drawn With Some Vertices per Face: Density and Relationships
inferred← citeshttps://doi.org/10.1137/12088104xopenalex-snapshot
Density Theorems for Intersection Graphs of $t$-Monotone Curves
inferred← citeshttps://doi.org/10.1145/1377676.1377735openalex-snapshot
Coloring k k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1145/1542362.1542430openalex-snapshot
On grids in topological graphs
inferred← citeshttps://doi.org/10.1145/177424.177629openalex-snapshot
Applications of the crossing number
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.1201/b16132-29openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot
Matchings in Geometric Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2132openalex-snapshot
Packing Plane Perfect Matchings into a Point Set
inferred← citeshttps://doi.org/10.46298/dmtcs.525openalex-snapshot
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1502.06168openalex-snapshot
A new upper bound for the clique cover number with applications
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05286openalex-snapshot
Algorithms For Longest Chains In Pseudo- Transitive Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.