On the public citation graph
Recent results on generalized Ramsey theory for graphs
0 signed · 75 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.1007/bf01431439openalex-snapshot
A Ramsey-type problem for paths in digraphs
inferredcites →https://doi.org/10.1007/bf02018466openalex-snapshot
Generalized ramsey theory for graphs, I. Diagonal numbers
inferredcites →https://doi.org/10.1007/bfb0059431openalex-snapshot
On small graphs with forced monochromatic triangles
inferredcites →https://doi.org/10.1007/bfb0067380openalex-snapshot
Progress on the problem of eccentric hosts
inferredcites →https://doi.org/10.1016/s0021-9800(68)80009-2openalex-snapshot
On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
inferredcites →https://doi.org/10.1016/s0095-8956(73)80005-xopenalex-snapshot
Ramsey numbers for cycles in graphs
inferredcites →https://doi.org/10.1080/00029890.1959.11989408openalex-snapshot
On Sets of Acquaintances and Strangers at any Party
inferredcites →https://doi.org/10.1080/0025570x.1972.11976213openalex-snapshot
The Two-Triangle Case of the Acquaintance Graph
inferredcites →https://doi.org/10.1090/s0002-9904-1971-12832-xopenalex-snapshot
On the existence of specified cycles in complementary graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1972-12927-6openalex-snapshot
Generalized Ramsey theory for graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0332559-xopenalex-snapshot
Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4790443openalex-extracted
Monochromatic Stars and Stripes in Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.1002/jgt.20452openalex-snapshot
Ramsey‐type results for Gallai colorings
inferred← citeshttps://doi.org/10.1002/jgt.22119openalex-snapshot
Conditions on Ramsey Nonequivalence
inferred← citeshttps://doi.org/10.1002/jgt.3190040403openalex-snapshot
On the Ramsey multiplicities of graphs—problems and recent results
inferred← citeshttps://doi.org/10.1002/jgt.3190070404openalex-snapshot
On Ramsey numbers involving starlike multipartite graphs
inferred← citeshttps://doi.org/10.1002/net.3230040206openalex-snapshot
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
inferred← citeshttps://doi.org/10.1007/3-540-06682-9_46openalex-snapshot
From van't Hoff to unified perspectives in molecular structure and computer oriented representation
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_7openalex-snapshot
Computing Labeled Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_6openalex-snapshot
Upward Planarity Checking: “Faces Are More than Polygons”
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_25openalex-snapshot
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_19openalex-snapshot
Tree Containment and Degree Conditions
inferred← citeshttps://doi.org/10.1007/978-3-031-29981-0_2openalex-snapshot
Star-Critical Ramsey Numbers Involving Various Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_22openalex-snapshot
Recent Developments of Star-Critical Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_13openalex-snapshot
Computing Maximum Unavoidable Subgraphs Using SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_13openalex-snapshot
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
inferred← citeshttps://doi.org/10.1007/978-3-540-77224-8_37openalex-snapshot
Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions − 9 Variable Boolean Functions with Nonlinearity 242
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_24openalex-snapshot
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
inferred← citeshttps://doi.org/10.1007/bf02662066openalex-snapshot
At most single-bend embeddings of cubic graphs
inferred← citeshttps://doi.org/10.1007/bf02669709openalex-snapshot
Completely positive matrices of order five
inferred← citeshttps://doi.org/10.1007/bf03322761openalex-snapshot
Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/bfb0066430openalex-snapshot
A survey of generalized ramsey theory
inferred← citeshttps://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferred← citeshttps://doi.org/10.1007/bfb0071612openalex-snapshot
An achievement game on a toroidal board
inferred← citeshttps://doi.org/10.1007/bfb0111429openalex-snapshot
From van’t hoff to unified perspectives in molecular structure and computer oriented representation
inferred← citeshttps://doi.org/10.1007/s00236-025-00516-9openalex-snapshot
Ramsey achievement games on graphs : algorithms and bounds
inferred← citeshttps://doi.org/10.1007/s00373-002-0495-7openalex-snapshot
On Some Three-Color Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-013-1307-yopenalex-snapshot
A Degree Sequence Variant of Graph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-016-1746-3openalex-snapshot
An Exact Formula for all Star-Kipas Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s10021-007-9038-7openalex-snapshot
Spatial Graphs: Principles and Applications for Habitat Connectivity
inferred← citeshttps://doi.org/10.1007/s10474-007-6133-3openalex-snapshot
The basis number of the Cartesian product of stars and wheels with different ladders
inferred← citeshttps://doi.org/10.1007/s10910-005-9008-2openalex-snapshot
On the complexity of Archimedean solids
inferred← citeshttps://doi.org/10.1007/s11128-016-1363-3openalex-snapshot
Generalized Ramsey numbers through adiabatic quantum optimization
inferred← citeshttps://doi.org/10.1007/s13226-025-00747-zopenalex-snapshot
Gallai–Ramsey numbers for rainbow trees and monochromatic double stars or books
inferred← citeshttps://doi.org/10.1007/s41109-024-00647-xopenalex-snapshot
A bridge between influence models and control methods
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90045-9openalex-snapshot
The Ramsey numbers r(Pm, Kn)
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90172-5openalex-snapshot
What can we hope to accomplish in generalized Ramsey theory?
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90065-9openalex-snapshot
Ramsey numbers based on C5-decompositions
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90048-3openalex-snapshot
Path-Star Ramsey numbers
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90209-xopenalex-snapshot
Some new computer generated results in Ramsey graph theory
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.016openalex-snapshot
Set and size multipartite Ramsey numbers for stars
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103096openalex-snapshot
Strong Ramsey games in unbounded time
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73554-0openalex-snapshot
Achievement and Avoidance Games for Graphs
inferred← citeshttps://doi.org/10.1016/s1385-7258(78)80009-2openalex-snapshot
Ramsey-minimal graphs for multiple copies
inferred← citeshttps://doi.org/10.1017/s1446788700029554openalex-snapshot
The Ramsey number for stripes
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0396317-xopenalex-snapshot
Ramsey Graphs and Block Designs. I
inferred← citeshttps://doi.org/10.1112/jlms/s2-24.3.405openalex-snapshot
Ramsey Numbers Involving Graphs with Long Suspended Paths
inferred← citeshttps://doi.org/10.1134/s0001434626600262openalex-snapshot
On the Ramsey Number $$R(K_{1,s},P_t)$$
inferred← citeshttps://doi.org/10.1137/25m1807915openalex-snapshot
Recent Progress in Graph Theory Using Expansion
inferred← citeshttps://doi.org/10.1155/2018/9250424openalex-snapshot
On Super Mean Labeling for Total Graph of Path and Cycle
inferred← citeshttps://doi.org/10.37236/830openalex-snapshot
The Loebl–Komlós–Sós Conjecture for Trees of Diameter $5$ and for Certain Caterpillars
inferred← citeshttps://doi.org/10.3990/1.9789036538329openalex-snapshot
Generalized Ramsey numbers for graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3382openalex-snapshot
The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3050openalex-snapshot
The approximate Loebl-Komlós-Sós Conjecture
inferred← citeshttps://doi.org/10.7151/dmgt.2550openalex-snapshot
Star-critical Ramsey numbers and regular Ramsey numbers for stars
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.