On the public citation graph

Partitionstheoreme für Graphen

https://doi.org/10.1007/bf02565753
0 signed · 33 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/bfb0067364openalex-snapshot
Recent results on generalized Ramsey theory for graphs
inferredcites →https://doi.org/10.1016/0001-8708(72)90005-9openalex-snapshot
Ramsey's theorem for a class of categories
inferredcites →https://doi.org/10.1016/0095-8956(75)90057-xopenalex-snapshot
A generalization of Ramsey's theorem for regular trees
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.1137/0118004openalex-snapshot
Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
inferredcites →https://doi.org/10.4153/cjm-1973-061-1openalex-snapshot
Edge Partition Properties 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.1006/eujc.1993.0075openalex-snapshot
Chromatic Ramsey Theory
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_22openalex-snapshot
The Random Graph
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_23openalex-snapshot
Paul Erdős’ Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-01315-2_12openalex-snapshot
Finite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_11openalex-snapshot
Erdős’s Work on Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_32openalex-snapshot
The Random Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_33openalex-snapshot
Paul Erdős’ Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_9openalex-snapshot
Graham-Rothschild Parameter Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_9openalex-snapshot
True Embedding Partition Relations
inferred← citeshttps://doi.org/10.1007/bf01872104openalex-snapshot
A consistent edge partition theorem for infinite graphs
inferred← citeshttps://doi.org/10.1007/bf02773844openalex-snapshot
Embedding finite graphs into graphs colored with infinitely many colors
inferred← citeshttps://doi.org/10.1007/bf02986660openalex-snapshot
Intersection Dimensions of Graph Classes
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90175-8openalex-snapshot
Partition theorems for parameter systems and graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90118-9openalex-snapshot
Two remarks on Ramsey's theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90056-0openalex-snapshot
Partition properties of q-hypergraphs
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90036-6openalex-snapshot
Induced partition properties of combinatorial cubes
inferred← citeshttps://doi.org/10.1016/0097-3165(90)90008-kopenalex-snapshot
Iterated combinatorial density theorems
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.apal.2005.07.004openalex-snapshot
Ramsey classes of topological and metric spaces
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.019openalex-snapshot
A short proof of the induced Ramsey Theorem for hypergraphs
inferred← citeshttps://doi.org/10.1017/s0963548304006674openalex-snapshot
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber
inferred← citeshttps://doi.org/10.1017/s0963548304006716openalex-snapshot
Ramsey Classes and Homogeneous Structures
inferred← citeshttps://doi.org/10.1017/s096354831200003xopenalex-snapshot
Distance Preserving Ramsey Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0936824-0openalex-snapshot
Embedding Graphs into Colored Graphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17768.xopenalex-snapshot
A SURVEY OF NONCOMPLETE RAMSEY THEORY FOR GRAPHS
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7870openalex-snapshot
Multicoloured Random Graphs: Constructions and Symmetry
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.