On the public citation graph

Ramsey-Type Results for Geometric Graphs, II

https://doi.org/10.1007/pl00009391
0 signed · 26 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/3-540-62495-3_33openalex-snapshot
Bipartite embeddings of trees in the plane
inferredcites →https://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferredcites →https://doi.org/10.1007/pl00009317openalex-snapshot
Ramsey-Type Results for Geometric Graphs, I
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.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
inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot
Combinatorial geometry

What points at this work

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

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-3-319-03841-4_32openalex-snapshot
A Ramsey-Type Result for Geometric ℓ-Hypergraphs
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-642-55566-4_12openalex-snapshot
A Turán-type Extremal Theory of Convex Geometric Graphs
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/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.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.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.2014.04.001openalex-snapshot
A Ramsey-type result for geometric ℓ -hypergraphs
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/s0304-3975(00)00233-4openalex-snapshot
Generalized and geometric Ramsey numbers for cycles
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.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
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.