On the public citation graph
Ramsey-Type Results for Geometric Graphs, I
0 signed · 74 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190070115openalex-snapshot
On size Ramsey number of paths, trees, and circuits. I
inferredcites →https://doi.org/10.1002/jgt.3190070116openalex-snapshot
Vertex coverings by monochromatic paths and cycles
inferredcites →https://doi.org/10.1007/3-540-62495-3_33openalex-snapshot
Bipartite embeddings of trees in the plane
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-3-642-61324-1_7openalex-snapshot
Covering Complete Graphs by Monochromatic Paths
inferredcites →https://doi.org/10.1007/978-3-642-72905-8_4openalex-snapshot
On Size Ramsey Number of Paths, Trees and Circuits. II
inferredcites →https://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferredcites →https://doi.org/10.1016/0095-8956(91)90007-7openalex-snapshot
Vertex coverings by monochromatic cycles and trees
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1016/s0167-5060(08)70507-7openalex-snapshot
Monochromatic Paths in Graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0409255-0openalex-snapshot
Ramsey theorems for multiple copies of graphs
inferredcites →https://doi.org/10.1145/237218.237405openalex-snapshot
Ramsey-type results for geometric graphs
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/1997371openalex-snapshot
Ramsey Theorems for Multiple Copies of Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23058openalex-snapshot
Monochromatic spanning trees and matchings in ordered complete graphs
inferred← citeshttps://doi.org/10.1007/978-0-8176-8092-3_5openalex-snapshot
Large Monochromatic Components in Edge Colorings of Graphs: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_19openalex-snapshot
Ramsey-Type Problems for Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_20openalex-snapshot
Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_37openalex-snapshot
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_32openalex-snapshot
A Ramsey-Type Result for Geometric ℓ-Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_26openalex-snapshot
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_34openalex-snapshot
Long Alternating Paths in Bicolored Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_23openalex-snapshot
Maximal Number of Edges in Geometric Graphs without Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_24openalex-snapshot
A Note on the Existente of Plane Spanning Trees of Geometrie 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_17openalex-snapshot
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_12openalex-snapshot
A Turán-type Extremal Theory of Convex Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_28openalex-snapshot
Polynomial bounds on geometric Ramsey numbers of ladder graphs
inferred← citeshttps://doi.org/10.1007/pl00009391openalex-snapshot
Ramsey-Type Results for Geometric Graphs, II
inferred← citeshttps://doi.org/10.1007/s00373-004-0606-8openalex-snapshot
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/s00373-007-0752-xopenalex-snapshot
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
inferred← citeshttps://doi.org/10.1007/s00373-009-0847-7openalex-snapshot
On Geometric Graph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-012-1190-yopenalex-snapshot
On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids
inferred← citeshttps://doi.org/10.1007/s00454-010-9277-9openalex-snapshot
Long Non-crossing Configurations in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-014-9646-xopenalex-snapshot
On the Geometric Ramsey Number of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s10474-021-01166-2openalex-snapshot
Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
inferred← citeshttps://doi.org/10.1007/s11083-025-09722-zopenalex-snapshot
A Multipartite Analogue of Dilworth’s Theorem
inferred← citeshttps://doi.org/10.1016/j.aim.2012.03.011openalex-snapshot
String graphs and incomparability graphs
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.2008.07.002openalex-snapshot
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.006openalex-snapshot
A sufficient condition for the existence of plane spanning trees on geometric graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.010openalex-snapshot
Connecting colored point sets
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.013openalex-snapshot
Long alternating paths in bicolored point sets
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.021openalex-snapshot
On the geometric Ramsey numbers of trees
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.006openalex-snapshot
Ramsey-type constructions for arrangements of segments
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.04.001openalex-snapshot
A Ramsey-type result for geometric ℓ -hypergraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.054openalex-snapshot
Ramsey-type constructions for arrangements of segments
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.059openalex-snapshot
Ramsey numbers of ordered graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.12.003openalex-snapshot
On plane spanning trees and cycles of multicolored point sets with few intersections
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.04.006openalex-snapshot
Packing plane spanning trees and paths in complete geometric graphs
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.1016/s0304-3975(00)00233-4openalex-snapshot
Generalized and geometric Ramsey numbers for cycles
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00042-6openalex-snapshot
Sequences of spanning trees and a fixed tree theorem
inferred← citeshttps://doi.org/10.1016/s0925-7721(03)00013-0openalex-snapshot
Chromatic variants of the Erdos–Szekeres theorem on points in convex position
inferred← citeshttps://doi.org/10.1017/s0963548320000504openalex-snapshot
Disjointness graphs of segments in the space
inferred← citeshttps://doi.org/10.1090/conm/342/06137openalex-snapshot
Coloring intersection graphs of geometric figures with a given clique number
inferred← citeshttps://doi.org/10.1145/2261250.2261311openalex-snapshot
String graphs and incomparability graphs
inferred← citeshttps://doi.org/10.1145/2421119.2421136openalex-snapshot
Computational geometry column 54
inferred← citeshttps://doi.org/10.1155/2014/731519openalex-snapshot
Noncrossing Monochromatic Subtrees and Staircases in 0-1 Matrices
inferred← citeshttps://doi.org/10.46298/dmtcs.1367openalex-snapshot
Ramsey-type theorems for lines in 3-space
inferred← citeshttps://doi.org/10.46298/dmtcs.525openalex-snapshot
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.628openalex-snapshot
The Erdős-Sós conjecture for geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4094openalex-snapshot
Long non-crossing configurations in the plane
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5227openalex-snapshot
A Ramsey-type result for geometric l-hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.2185openalex-snapshot
Geometric graphs on convex point sets
inferred← citeshttps://doi.org/10.48550/arxiv.1605.08066openalex-snapshot
Edge complexity of geometric graphs on convex independent point sets
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.