On the public citation graph
Small Ramsey Numbers
0 signed · 730 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/(sici)1097-0118(199612)23:4<413::aid-jgt10>3.0.co;2-dopenalex-snapshot
Fan-complete graph Ramsey numbers
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199711)26:3<119::aid-jgt1>3.0.co;2-uopenalex-snapshot
Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
inferredcites →https://doi.org/10.1002/1097-0118(200010)35:2<99::aid-jgt4>3.0.co;2-6openalex-snapshot
The Ramsey number for a cycle of length five vs. a complete graph of order six
inferredcites →https://doi.org/10.1002/1097-0118(200011)35:3<176::aid-jgt3>3.0.co;2-copenalex-snapshot
On graphs with linear Ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.1014openalex-snapshot
On graphs with small Ramsey numbers*
inferredcites →https://doi.org/10.1002/jgt.10145openalex-snapshot
All cycle‐complete graph Ramsey numbers r(Cm, K6)
inferredcites →https://doi.org/10.1002/jgt.20103openalex-snapshot
Linear Ramsey numbers of sparse graphs
inferredcites →https://doi.org/10.1002/jgt.20118openalex-snapshot
Ramsey unsaturated and saturated graphs
inferredcites →https://doi.org/10.1002/jgt.20492openalex-snapshot
Monochromatic cycle partitions of edge-colored graphs
inferredcites →https://doi.org/10.1002/jgt.20572openalex-snapshot
On the multi‐colored Ramsey numbers of cycles
inferredcites →https://doi.org/10.1002/jgt.21771openalex-snapshot
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
inferredcites →https://doi.org/10.1002/jgt.3190010118openalex-snapshot
Tree‐complete graph ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190020107openalex-snapshot
On cycle—Complete graph ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190020112openalex-snapshot
Ramsey numbers for multiple copies of complete graphs
inferredcites →https://doi.org/10.1002/jgt.3190040211openalex-snapshot
On ramsey numbers of forests versus nearly complete graphs
inferredcites →https://doi.org/10.1002/jgt.3190040307openalex-snapshot
All triangle‐graph ramsey numbers for connected graphs of order six
inferredcites →https://doi.org/10.1002/jgt.3190040403openalex-snapshot
On the Ramsey multiplicities of graphs—problems and recent results
inferredcites →https://doi.org/10.1002/jgt.3190050109openalex-snapshot
A note on constructive methods for ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190060405openalex-snapshot
Bounds for the ramsey number of a disconnected graph versus any graph
inferredcites →https://doi.org/10.1002/jgt.3190070105openalex-snapshot
A survey of bounds for classical Ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190070106openalex-snapshot
Generalizations of a Ramsey‐theoretic result of chvátal
inferredcites →https://doi.org/10.1002/jgt.3190070108openalex-snapshot
Diagonal Ramsey numbers for small graphs
inferredcites →https://doi.org/10.1002/jgt.3190070109openalex-snapshot
On the Ramsey number of trees versus graphs with large clique number
inferredcites →https://doi.org/10.1002/jgt.3190070404openalex-snapshot
On Ramsey numbers involving starlike multipartite graphs
inferredcites →https://doi.org/10.1002/jgt.3190070413openalex-snapshot
On the existence of specified cycles in a tournament
inferredcites →https://doi.org/10.1002/jgt.3190080121openalex-snapshot
The ramsey numbers for stripes and one complete graph
inferredcites →https://doi.org/10.1002/jgt.3190090408openalex-snapshot
An upper bound for the ramsey number r(K5 − e)
inferredcites →https://doi.org/10.1002/jgt.3190100108openalex-snapshot
Bipartite density and the independence ratio
inferredcites →https://doi.org/10.1002/jgt.3190120107openalex-snapshot
Search algorithm for Ramsey graphs by union of group orbits
inferredcites →https://doi.org/10.1002/jgt.3190120406openalex-snapshot
An upper bound for some ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190130210openalex-snapshot
Ramsey numbers for graphs with five vertices
inferredcites →https://doi.org/10.1002/jgt.3190140503openalex-snapshot
Size and independence in triangle‐free graphs with maximum degree three
inferredcites →https://doi.org/10.1002/jgt.3190150104openalex-snapshot
An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G
inferredcites →https://doi.org/10.1002/jgt.3190160105openalex-snapshot
Ramsey problems and their connection to tuŕan‐type extremal problems
inferredcites →https://doi.org/10.1002/jgt.3190160111openalex-snapshot
The value of the Ramsey number r(3, 8)
inferredcites →https://doi.org/10.1002/jgt.3190180406openalex-snapshot
Subdivided graphs have linear ramsey numbers
inferredcites →https://doi.org/10.1002/jgt.3190190103openalex-snapshot
The ramsey number r(k1 + c4, k5 − e)
inferredcites →https://doi.org/10.1002/rsa.3240070204openalex-snapshot
Bounding Ramsey numbers through large deviation inequalities
inferredcites →https://doi.org/10.1002/rsa.3240070302openalex-snapshot
The Ramsey number R(3, t) has order of magnitude t2/log t
inferredcites →https://doi.org/10.1006/aama.2000.0678openalex-snapshot
Difference Ramsey Numbers and Issai Numbers
inferredcites →https://doi.org/10.1006/aama.2001.0794openalex-snapshot
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
inferredcites →https://doi.org/10.1006/eujc.1997.0186openalex-snapshot
New Upper Bounds for Ramsey Numbers
inferredcites →https://doi.org/10.1006/eujc.2000.0438openalex-snapshot
New Upper and Lower Bounds for Ramsey Numbers
inferredcites →https://doi.org/10.1006/jcta.1996.0043openalex-snapshot
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
inferredcites →https://doi.org/10.1006/jctb.1993.1012openalex-snapshot
Graphs with Linearly Bounded Ramsey Numbers
inferredcites →https://doi.org/10.1006/jctb.1993.1013openalex-snapshot
A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t)
inferredcites →https://doi.org/10.1006/jctb.1993.1036openalex-snapshot
The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1
inferredcites →https://doi.org/10.1006/jctb.1994.1030openalex-snapshot
Subtrees and Subforests of Graphs
inferredcites →https://doi.org/10.1006/jctb.1994.1038openalex-snapshot
Linear Programming in Some Ramsey Problems
inferredcites →https://doi.org/10.1006/jctb.1996.0055openalex-snapshot
On Book-Complete Graph Ramsey Numbers
inferredcites →https://doi.org/10.1006/jctb.1996.1741openalex-snapshot
Subgraph Counting Identities and Ramsey Numbers
inferredcites →https://doi.org/10.1006/jctb.1999.1948openalex-snapshot
On Generalized Ramsey Theory: The Bipartite Case
inferredcites →https://doi.org/10.1006/jctb.2000.1954openalex-snapshot
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4)
inferredcites →https://doi.org/10.1007/978-0-387-74642-5openalex-snapshot
The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators
inferredcites →https://doi.org/10.1007/978-0-8176-8092-3openalex-snapshot
Ramsey theory : yesterday, today, and tomorrow
inferredcites →https://doi.org/10.1007/978-0-8176-8092-3_2openalex-snapshot
Eighty Years of RamseyR(3, k)…and Counting!
inferredcites →https://doi.org/10.1007/978-0-8176-8092-3_3openalex-snapshot
Ramsey Numbers Involving Cycles
inferredcites →https://doi.org/10.1007/978-1-4614-7254-4_17openalex-snapshot
Arrangeability and Clique Subdivisions
inferredcites →https://doi.org/10.1007/978-3-540-30540-8_20openalex-snapshot
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels
inferredcites →https://doi.org/10.1007/978-3-540-89550-3_9openalex-snapshot
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle
inferredcites →https://doi.org/10.1007/978-3-642-14031-0_24openalex-snapshot
The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs
inferredcites →https://doi.org/10.1007/978-3-642-36065-7_24openalex-snapshot
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
inferredcites →https://doi.org/10.1007/978-3-642-72905-8_5openalex-snapshot
On the Computational Complexity of Ramsey—Type Problems
inferredcites →https://doi.org/10.1007/bf01788524openalex-snapshot
Goodness of trees for generalized books
inferredcites →https://doi.org/10.1007/bf02018466openalex-snapshot
Generalized ramsey theory for graphs, I. Diagonal numbers
inferredcites →https://doi.org/10.1007/bf02579174openalex-snapshot
On the combinatorial problems which I would most like to see solved
inferredcites →https://doi.org/10.1007/bf02579245openalex-snapshot
Multipartite graph—Sparse graph Ramsey numbers
inferredcites →https://doi.org/10.1007/bf02579372openalex-snapshot
On generalized ramsey numbers for trees
inferredcites →https://doi.org/10.1007/bf02579457openalex-snapshot
Intersection theorems with geometric consequences
inferredcites →https://doi.org/10.1007/bf02809902openalex-snapshot
Constructive lower bounds for off-diagonal Ramsey numbers
inferredcites →https://doi.org/10.1007/bf02883828openalex-snapshot
New lower bounds of classical Ramsey numbersR(4, 12),R(5, 11) andR(5, 12)
inferredcites →https://doi.org/10.1007/bf02901123openalex-snapshot
The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdös
inferredcites →https://doi.org/10.1007/bf02986688openalex-snapshot
Upper Bounds for a Ramsey Theorem for Trees
inferredcites →https://doi.org/10.1007/bf02988318openalex-snapshot
On graphsG for which all large trees areG-good
inferredcites →https://doi.org/10.1007/bf03182742openalex-snapshot
New lower bounds of classical Ramsey numbersR(6, 12),R(6, 14) andR(6, 15)
inferredcites →https://doi.org/10.1007/bf03322761openalex-snapshot
Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs
inferredcites →https://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferredcites →https://doi.org/10.1007/bfb0066445openalex-snapshot
On triangular and cyclic ramsey numbers with k colors
inferredcites →https://doi.org/10.1007/bfb0066447openalex-snapshot
On the ramsey number of the five-spoked wheel
inferredcites →https://doi.org/10.1007/bfb0067364openalex-snapshot
Recent results on generalized Ramsey theory for graphs
inferredcites →https://doi.org/10.1007/pl00021176openalex-snapshot
The Generation of Maximal Triangle-Free Graphs
inferredcites →https://doi.org/10.1007/s00373-002-0495-7openalex-snapshot
On Some Three-Color Ramsey Numbers
inferredcites →https://doi.org/10.1007/s00373-006-0659-yopenalex-snapshot
New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m)
inferredcites →https://doi.org/10.1007/s00373-007-0764-6openalex-snapshot
The Ramsey Numbers of Large cycles Versus Odd Wheels
inferredcites →https://doi.org/10.1007/s00373-008-0784-xopenalex-snapshot
On the Ramsey Number of Sparse 3-Graphs
inferredcites →https://doi.org/10.1007/s00373-010-0959-0openalex-snapshot
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
inferredcites →https://doi.org/10.1007/s00373-011-1069-3openalex-snapshot
Three-Color Ramsey Numbers of K n Dropping an Edge
inferredcites →https://doi.org/10.1007/s00373-014-1507-0openalex-snapshot
On Three-Color Ramsey Number of Paths
inferredcites →https://doi.org/10.1007/s003730170060openalex-snapshot
Asymptotic Upper Bounds for Ramsey Functions
inferredcites →https://doi.org/10.1007/s003730200056openalex-snapshot
On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices
inferredcites →https://doi.org/10.1007/s00493-004-0024-9openalex-snapshot
On Graphs With Small Ramsey Numbers, II
inferredcites →https://doi.org/10.1007/s00493-005-0011-9openalex-snapshot
Sharp Bounds For Some Multicolor Ramsey Numbers
inferredcites →https://doi.org/10.1007/s00493-009-2356-yopenalex-snapshot
Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs
inferredcites →https://doi.org/10.1007/s00493-009-2475-5openalex-snapshot
Density theorems for bipartite graphs and related Ramsey-type results
inferredcites →https://doi.org/10.1007/s00493-012-2710-3openalex-snapshot
On two problems in graph Ramsey theory
inferredcites →https://doi.org/10.1007/s004930070032openalex-snapshot
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
inferredcites →https://doi.org/10.1007/s004930100018openalex-snapshot
On Bipartite Graphs with Linear Ramsey Numbers
inferredcites →https://doi.org/10.1007/s004930200014openalex-snapshot
Ramsey Numbers for Trees of Small Maximum Degree
inferredcites →https://doi.org/10.1007/s11856-011-0016-6openalex-snapshot
Large almost monochromatic subsets in hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(73)90045-9openalex-snapshot
The Ramsey numbers r(Pm, Kn)
inferredcites →https://doi.org/10.1016/0012-365x(73)90125-8openalex-snapshot
On the ramsey numbers N(3,3,…3;2)
inferredcites →https://doi.org/10.1016/0012-365x(73)90174-xopenalex-snapshot
The ramsey number N(3, 3, 3, 3; 2)
inferredcites →https://doi.org/10.1016/0012-365x(74)90008-9openalex-snapshot
Generalised Ramsey numbers for small graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90122-8openalex-snapshot
Path-cycle Ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(74)90136-8openalex-snapshot
On Ramsey numbers for linear forests
inferredcites →https://doi.org/10.1016/0012-365x(74)90151-4openalex-snapshot
All Ramsey numbers for cycles in graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90005-4openalex-snapshot
Sum-free sets and Ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(76)90142-4openalex-snapshot
Ramsey numbers for all linear forests
inferredcites →https://doi.org/10.1016/0012-365x(77)90044-9openalex-snapshot
Asymptotic lower bounds for Ramsey functions
inferredcites →https://doi.org/10.1016/0012-365x(79)90132-8openalex-snapshot
Generalized ramsey theory for graphs, x: double stars
inferredcites →https://doi.org/10.1016/0012-365x(80)90104-1openalex-snapshot
A lower bound for Ramsey's theorem
inferredcites →https://doi.org/10.1016/0012-365x(82)90017-6openalex-snapshot
Ramsey numbers of graphs with long tails
inferredcites →https://doi.org/10.1016/0012-365x(82)90154-6openalex-snapshot
Remarks on a paper of Hirschfeld concerning Ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(83)90273-xopenalex-snapshot
A note on the independence number of triangle-free graphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90053-7openalex-snapshot
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large
inferredcites →https://doi.org/10.1016/0012-365x(87)90107-5openalex-snapshot
An upper bound on the Ramsey number of trees
inferredcites →https://doi.org/10.1016/0012-365x(87)90172-5openalex-snapshot
What can we hope to accomplish in generalized Ramsey theory?
inferredcites →https://doi.org/10.1016/0012-365x(87)90173-7openalex-snapshot
A Ramsey problem of Harary on graphs with prescribed size
inferredcites →https://doi.org/10.1016/0012-365x(88)90004-0openalex-snapshot
On ramsey numbers for large disjoint unions of graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90056-8openalex-snapshot
Ramsey numbers for unions of some cycles
inferredcites →https://doi.org/10.1016/0012-365x(88)90065-9openalex-snapshot
Ramsey numbers based on C5-decompositions
inferredcites →https://doi.org/10.1016/0012-365x(88)90136-7openalex-snapshot
All Ramsey numbers for five vertices and seven or eight edges
inferredcites →https://doi.org/10.1016/0012-365x(88)90198-7openalex-snapshot
Extremal theory and bipartite graph-tree Ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(88)90200-2openalex-snapshot
Small order graph-tree Ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(89)90090-3openalex-snapshot
On the path-complete bipartite Ramsey number
inferredcites →https://doi.org/10.1016/0012-365x(90)90379-vopenalex-snapshot
Lower bounds for bi-colored quaternary ramsey numbers
inferredcites →https://doi.org/10.1016/0012-365x(91)90122-iopenalex-snapshot
Three color Ramsey number of K4 − e
inferredcites →https://doi.org/10.1016/0012-365x(92)90627-ropenalex-snapshot
The Ramsey numbers for stripes and complete graphs 1
inferredcites →https://doi.org/10.1016/0012-365x(93)e0139-uopenalex-snapshot
Shift graphs and lower bounds on Ramsey numbers rk(l; r)
inferredcites →https://doi.org/10.1016/0012-365x(94)00308-6openalex-snapshot
Zero-sum problems — A survey
inferredcites →https://doi.org/10.1016/0012-365x(94)00309-7openalex-snapshot
The Ramsey numbers for disjoint unions of cycles
inferredcites →https://doi.org/10.1016/0012-365x(94)90158-9openalex-snapshot
An upper bound for the Ramsey numbers r(K3,G)
inferredcites →https://doi.org/10.1016/0012-365x(94)90182-1openalex-snapshot
The third Ramsey numbers for graphs with at most four edges
inferredcites →https://doi.org/10.1016/0012-365x(95)00049-3openalex-snapshot
New lower bounds for Ramsey number R (p, q; 4)
inferredcites →https://doi.org/10.1016/0012-365x(95)00340-3openalex-snapshot
A result on C4-star Ramsey numbers
inferredcites →https://doi.org/10.1016/0024-3795(82)90037-4openalex-snapshot
Strongly regular graphs and finite Ramsey theory
inferredcites →https://doi.org/10.1016/0095-8956(72)90051-2openalex-snapshot
Some lower bounds of the Ramsey numbers n(k, k)
inferredcites →https://doi.org/10.1016/0095-8956(73)90035-xopenalex-snapshot
On a ramsey-type problem of J. A. Bondy and P. Erdös. I
inferredcites →https://doi.org/10.1016/0095-8956(74)90048-3openalex-snapshot
Path-Star Ramsey numbers
inferredcites →https://doi.org/10.1016/0095-8956(74)90085-9openalex-snapshot
Some tree-star Ramsey Numbers
inferredcites →https://doi.org/10.1016/0095-8956(75)90043-xopenalex-snapshot
On multicolor Ramsey numbers for complete bipartite graphs
inferredcites →https://doi.org/10.1016/0095-8956(75)90080-5openalex-snapshot
Path Ramsey numbers in multicolorings
inferredcites →https://doi.org/10.1016/0095-8956(76)90016-2openalex-snapshot
Generalized Ramsey theory for multiple colors
inferredcites →https://doi.org/10.1016/0095-8956(77)90041-7openalex-snapshot
Ramsey numbers for quadrangles and triangles
inferredcites →https://doi.org/10.1016/0095-8956(79)90016-9openalex-snapshot
Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
inferredcites →https://doi.org/10.1016/0095-8956(82)90055-7openalex-snapshot
On the Ramsey numbers R(3, 8) and R(3, 9)
inferredcites →https://doi.org/10.1016/0095-8956(83)90037-0openalex-snapshot
The Ramsey number of a graph with bounded maximum degree
inferredcites →https://doi.org/10.1016/0095-8956(84)90058-3openalex-snapshot
Independence in graphs with maximum degree four
inferredcites →https://doi.org/10.1016/0095-8956(87)90067-0openalex-snapshot
Lower bounds for Ramsey numbers and association schemes
inferredcites →https://doi.org/10.1016/0095-8956(88)90062-7openalex-snapshot
A simple construction giving the two non-isomorphic triangle-free 3-colored K16's
inferredcites →https://doi.org/10.1016/0095-8956(91)90080-4openalex-snapshot
A note on the independence number of triangle-free graphs, II
inferredcites →https://doi.org/10.1016/0097-3165(71)90002-1openalex-snapshot
An upper bound for the ramsey number M(5, 4)
inferredcites →https://doi.org/10.1016/0097-3165(74)90060-0openalex-snapshot
Notes on the Ramsey number N(3, 3, 3, 3)
inferredcites →https://doi.org/10.1016/0097-3165(74)90067-3openalex-snapshot
Lower bounds for some Ramsey numbers
inferredcites →https://doi.org/10.1016/0097-3165(75)90071-0openalex-snapshot
Ramsey's theorem—A new lower bound
inferredcites →https://doi.org/10.1016/0097-3165(76)90074-1openalex-snapshot
Ramsey graphs and block designs
inferredcites →https://doi.org/10.1016/0097-3165(79)90028-1openalex-snapshot
Schur numbers and the ramsey numbers N(3, 3,…, 3; 2)
inferredcites →https://doi.org/10.1016/0097-3165(80)90030-8openalex-snapshot
A note on Ramsey numbers
inferredcites →https://doi.org/10.1016/0097-3165(83)90003-1openalex-snapshot
An upper bound on the Ramsey numbers R(3, k)
inferredcites →https://doi.org/10.1016/0097-3165(86)90102-0openalex-snapshot
Lower bounds for small diagonal ramsey numbers
inferredcites →https://doi.org/10.1016/0166-218x(94)00167-copenalex-snapshot
Lower bounds for hypergraph Ramsey numbers
inferredcites →https://doi.org/10.1016/j.aim.2011.02.004openalex-snapshot
A conjecture of Erdős on graph Ramsey numbers
inferredcites →https://doi.org/10.1016/j.aml.2008.04.010openalex-snapshot
New lower bounds for seven classical Ramsey numbers R(3,q)
inferredcites →https://doi.org/10.1016/j.aml.2008.06.018openalex-snapshot
Ramsey numbers for a disjoint union of some graphs
inferredcites →https://doi.org/10.1016/j.aml.2009.05.002openalex-snapshot
Ramsey numbers involving graphs with large degrees
inferredcites →https://doi.org/10.1016/j.aml.2009.07.014openalex-snapshot
The Ramsey numbers for cycles versus wheels of odd order
inferredcites →https://doi.org/10.1016/j.aml.2011.09.018openalex-snapshot
Ramsey numbers of K3 and Kn,n
inferredcites →https://doi.org/10.1016/j.dam.2007.10.020openalex-snapshot
On multicolour noncomplete Ramsey graphs of star graphs
inferredcites →https://doi.org/10.1016/j.dam.2008.04.014openalex-snapshot
The Ramsey number for a cycle of length six versus a clique of order eight
inferredcites →https://doi.org/10.1016/j.dam.2010.10.013openalex-snapshot
An improved bound for the stepping-up lemma
inferredcites →https://doi.org/10.1016/j.dam.2010.11.007openalex-snapshot
Star-critical Ramsey numbers
inferredcites →https://doi.org/10.1016/j.dam.2012.04.009openalex-snapshot
Lower bounds for Ramsey numbers of with a small subgraph removed
inferredcites →https://doi.org/10.1016/j.dam.2012.07.018openalex-snapshot
House of Graphs: A database of interesting graphs
inferredcites →https://doi.org/10.1016/j.disc.2003.06.006openalex-snapshot
Some geometric structures and bounds for Ramsey numbers
inferredcites →https://doi.org/10.1016/j.disc.2004.10.017openalex-snapshot
The Ramsey numbers of paths versus wheels
inferredcites →https://doi.org/10.1016/j.disc.2004.10.024openalex-snapshot
The Ramsey number of paths with respect to wheels
inferredcites →https://doi.org/10.1016/j.disc.2004.12.003openalex-snapshot
Ramsey numbers of stars versus wheels of similar sizes
inferredcites →https://doi.org/10.1016/j.disc.2005.01.008openalex-snapshot
Ramsey functions involving K m , n with n large
inferredcites →https://doi.org/10.1016/j.disc.2005.09.024openalex-snapshot
Ramsey and 2-local Ramsey numbers for disjoint unions of cycles
inferredcites →https://doi.org/10.1016/j.disc.2005.10.037openalex-snapshot
A note on the Ramsey number of K2,2 versus K3,n
showing the first 200 of 362 · page through all 362
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.20118openalex-snapshot
Ramsey unsaturated and saturated graphs
inferred← citeshttps://doi.org/10.1002/jgt.20445openalex-snapshot
On the minimum degree of minimal Ramsey graphs
inferred← citeshttps://doi.org/10.1002/jgt.20492openalex-snapshot
Monochromatic cycle partitions of edge-colored graphs
inferred← citeshttps://doi.org/10.1002/jgt.20622openalex-snapshot
Extensions of Gallai–Ramsey results
inferred← citeshttps://doi.org/10.1002/jgt.21851openalex-snapshot
Monochromatic Clique Decompositions of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22835openalex-snapshot
Gallai–Ramsey number for K5 ${K}_{5}$
inferred← citeshttps://doi.org/10.1006/aama.2000.0678openalex-snapshot
Difference Ramsey Numbers and Issai Numbers
inferred← citeshttps://doi.org/10.1006/eujc.1997.0186openalex-snapshot
New Upper Bounds for Ramsey Numbers
inferred← citeshttps://doi.org/10.1006/eujc.2000.0442openalex-snapshot
R(C6, K5) = 21andR(C7, K5) = 25
inferred← citeshttps://doi.org/10.1006/jctb.1996.1741openalex-snapshot
Subgraph Counting Identities and Ramsey Numbers
inferred← citeshttps://doi.org/10.1006/jctb.2000.1954openalex-snapshot
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4)
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_21openalex-snapshot
Improving ASP Instantiators by Join-Ordering Methods
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_81openalex-snapshot
Ramsey numbers by stochastic algorithms with new heuristics
inferred← citeshttps://doi.org/10.1007/978-0-8176-8092-3_2openalex-snapshot
Eighty Years of RamseyR(3, k)…and Counting!
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_34openalex-snapshot
Lower Bounds for Small Ramsey Numbers on Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-48897-0_1openalex-snapshot
Introduction and Basic Definitions
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_81openalex-snapshot
On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-66997-2_6openalex-snapshot
Formalizing Finite Ramsey Theory in Lean 4
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_40openalex-snapshot
Expressing Symmetry Breaking in DRAT Proofs
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-319-49130-1_17openalex-snapshot
Boosting the Development of ASP-Based Applications in Mobile and General Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_20openalex-snapshot
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels
inferred← citeshttps://doi.org/10.1007/978-3-540-89550-3_9openalex-snapshot
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_24openalex-snapshot
The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_13openalex-snapshot
Extremal Problems for Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_17openalex-snapshot
The Disjunctive Datalog System DLV
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_18openalex-snapshot
Ramsey Numbers for Line Graphs and Perfect Graphs
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/978-3-642-39071-5_32openalex-snapshot
SCSat: A Soft Constraint Guided SAT Solver
inferred← citeshttps://doi.org/10.1007/bf02883828openalex-snapshot
New lower bounds of classical Ramsey numbersR(4, 12),R(5, 11) andR(5, 12)
inferred← citeshttps://doi.org/10.1007/bf02889502openalex-snapshot
Lower bounds for multicolor classical Ramsey numbers
inferred← citeshttps://doi.org/10.1007/bf03182742openalex-snapshot
New lower bounds of classical Ramsey numbersR(6, 12),R(6, 14) andR(6, 15)
inferred← citeshttps://doi.org/10.1007/pl00021176openalex-snapshot
The Generation of Maximal Triangle-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00037-017-0153-3openalex-snapshot
Block-symmetric polynomials correlate with parity better than symmetric
inferred← citeshttps://doi.org/10.1007/s00283-012-9275-2openalex-snapshot
Sketchy Tweets: Ten Minute Conjectures in Graph Theory
inferred← citeshttps://doi.org/10.1007/s00354-018-0046-2openalex-snapshot
Fostering the Use of Declarative Formalisms for Real-World Applications: The EmbASP Framework
inferred← citeshttps://doi.org/10.1007/s00373-002-0495-7openalex-snapshot
On Some Three-Color Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-006-0659-yopenalex-snapshot
New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m)
inferred← citeshttps://doi.org/10.1007/s00373-007-0764-6openalex-snapshot
The Ramsey Numbers of Large cycles Versus Odd Wheels
inferred← citeshttps://doi.org/10.1007/s00373-010-0891-3openalex-snapshot
Rainbow Generalizations of Ramsey Theory: A Survey
inferred← citeshttps://doi.org/10.1007/s00373-011-1069-3openalex-snapshot
Three-Color Ramsey Numbers of K n Dropping an Edge
inferred← citeshttps://doi.org/10.1007/s00373-012-1179-6openalex-snapshot
Large Chromatic Number and Ramsey Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1212-9openalex-snapshot
A Note on Turán Numbers for Even Wheels
inferred← citeshttps://doi.org/10.1007/s00373-012-1272-xopenalex-snapshot
List-Coloring Claw-Free Graphs with Small Clique Number
inferred← citeshttps://doi.org/10.1007/s00373-013-1293-0openalex-snapshot
On Some Ramsey Numbers for Quadrilaterals Versus Wheels
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-014-1504-3openalex-snapshot
Ramsey Numbers of $$C_4$$ C 4 versus Wheels and Stars
inferred← citeshttps://doi.org/10.1007/s00373-014-1507-0openalex-snapshot
On Three-Color Ramsey Number of Paths
inferred← citeshttps://doi.org/10.1007/s00373-014-1509-yopenalex-snapshot
All Complete Graph-Wheel Planar Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-014-1523-0openalex-snapshot
Three Results on Cycle-Wheel Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-015-1541-6openalex-snapshot
On Zero-Sum and Almost Zero-Sum Subgraphs Over $${\mathbb {Z}}$$ Z
inferred← citeshttps://doi.org/10.1007/s00373-017-1759-6openalex-snapshot
All Quadrilateral-Wheel Planar Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-018-1903-yopenalex-snapshot
Triangle Packings and Transversals of Some $$K_{4}$$ K 4 -Free Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1994-5openalex-snapshot
The Ramsey Numbers of Trees Versus Generalized Wheels
inferred← citeshttps://doi.org/10.1007/s00373-019-02013-6openalex-snapshot
On Some Three Color Ramsey Numbers for Paths, Cycles, Stripes and Stars
inferred← citeshttps://doi.org/10.1007/s00373-020-02134-3openalex-snapshot
Some Multi-Color Ramsey Numbers on Stars versus Path, Cycle or Wheel
inferred← citeshttps://doi.org/10.1007/s00373-020-02157-wopenalex-snapshot
Exact Values of Multicolor Ramsey Numbers $$R_l(C_{\le l+1})$$
inferred← citeshttps://doi.org/10.1007/s00373-020-02262-wopenalex-snapshot
On Ramsey Numbers $$R(K_4-e, K_t)$$
inferred← citeshttps://doi.org/10.1007/s00373-022-02516-9openalex-snapshot
Anti-van der Waerden Numbers on Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02561-4openalex-snapshot
Star-Critical Gallai–Ramsey Numbers of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02896-8openalex-snapshot
$${\mathcal {R}}(K_6-e,K_4) =30 ^*$$
inferred← citeshttps://doi.org/10.1007/s003730200056openalex-snapshot
On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices
inferred← citeshttps://doi.org/10.1007/s00493-013-2778-4openalex-snapshot
Ramsey-goodness—and otherwise
inferred← citeshttps://doi.org/10.1007/s004930200014openalex-snapshot
Ramsey Numbers for Trees of Small Maximum Degree
inferred← citeshttps://doi.org/10.1007/s10107-017-1127-6openalex-snapshot
Symmetric sums of squares over k-subset hypercubes
inferred← citeshttps://doi.org/10.1007/s10472-008-9090-9openalex-snapshot
Enhancing DLV instantiator by backjumping techniques
inferred← citeshttps://doi.org/10.1007/s10474-020-01054-1openalex-snapshot
Monochromatic Partitions In Local Edge Colorings
inferred← citeshttps://doi.org/10.1007/s10601-016-9240-3openalex-snapshot
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking
inferred← citeshttps://doi.org/10.1007/s10601-016-9244-zopenalex-snapshot
Breaking symmetries in graph search with canonizing sets
inferred← citeshttps://doi.org/10.1007/s10601-018-9294-5openalex-snapshot
Constraints for symmetry breaking in graph representation
inferred← citeshttps://doi.org/10.1007/s11083-004-6450-xopenalex-snapshot
Tube Representations of Ordered Sets
inferred← citeshttps://doi.org/10.1007/s11128-013-0541-9openalex-snapshot
Computing hypergraph Ramsey numbers by using quantum circuit
inferred← citeshttps://doi.org/10.1007/s11128-016-1363-3openalex-snapshot
Generalized Ramsey numbers through adiabatic quantum optimization
inferred← citeshttps://doi.org/10.1007/s11741-003-0050-7openalex-snapshot
Upper bounds for ramsey numbers R(m ,n ,1) and R(m ,n, l, s) with parameter
inferred← citeshttps://doi.org/10.1007/s11786-019-00397-5openalex-snapshot
Optimal Symmetry Breaking for Graph Problems
inferred← citeshttps://doi.org/10.1007/s40995-020-00872-wopenalex-snapshot
Ramsey Number of Disjoint Union of Good Hypergraphs
inferred← citeshttps://doi.org/10.1007/s40995-021-01256-4openalex-snapshot
On the Star-Critical Ramsey Number of a Forest Versus Complete Graphs
inferred← citeshttps://doi.org/10.1016/bs.adcom.2014.12.002openalex-snapshot
Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107444openalex-snapshot
Exact Ramsey numbers of odd cycles via nonlinear optimisation
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.09.004openalex-snapshot
Gallai-Ramsey number of an 8-cycle
inferred← citeshttps://doi.org/10.1016/j.aml.2008.04.010openalex-snapshot
New lower bounds for seven classical Ramsey numbers R(3,q)
inferred← citeshttps://doi.org/10.1016/j.aml.2009.07.014openalex-snapshot
The Ramsey numbers for cycles versus wheels of odd order
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.11.006openalex-snapshot
Weak Schur numbers and the search for G.W. Walker’s lost partitions
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.014openalex-snapshot
The Ramsey number for a cycle of length six versus a clique of order eight
inferred← citeshttps://doi.org/10.1016/j.dam.2012.04.009openalex-snapshot
Lower bounds for Ramsey numbers of with a small subgraph removed
inferred← citeshttps://doi.org/10.1016/j.dam.2014.03.016openalex-snapshot
Graph classes and Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.007openalex-snapshot
On the van der Waerden numbers w(2;3,t)
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.002openalex-snapshot
Sum-free cyclic multi-bases and constructions of Ramsey algebras
inferred← citeshttps://doi.org/10.1016/j.dam.2014.12.005openalex-snapshot
On Ramsey numbers of complete graphs with dropped stars
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.003openalex-snapshot
Wheel and star-critical Ramsey numbers for quadrilateral
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.038openalex-snapshot
Poonen’s conjecture and Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2015.08.020openalex-snapshot
On star-critical and upper size Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.002openalex-snapshot
On some three-color Ramsey numbers for paths
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.003openalex-snapshot
A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers R(3,k)
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.006openalex-snapshot
A coloring algorithm for 4K1 -free line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.056openalex-snapshot
Ramsey number of K3 versus F3,n
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.031openalex-snapshot
All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.003openalex-snapshot
Ramsey and Gallai–Ramsey numbers for stars with extra independent edges
inferred← citeshttps://doi.org/10.1016/j.dam.2020.07.001openalex-snapshot
On characterizing the critical graphs for matching Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2021.03.020openalex-snapshot
Gallai–Ramsey numbers for multiple triangles
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.028openalex-snapshot
Gallai and ℓ -uniform Ramsey numbers of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.017openalex-snapshot
The Ramsey numbers of paths versus wheels
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.024openalex-snapshot
The Ramsey number of paths with respect to wheels
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.086openalex-snapshot
Independence number and vertex-disjoint cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2006.05.034openalex-snapshot
The planar Ramsey number PR(K4-e,K5)
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.006openalex-snapshot
The Ramsey numbers of large cycles versus wheels
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.011openalex-snapshot
The Ramsey numbers for disjoint unions of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.007openalex-snapshot
New upper bound formulas with parameters for Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.036openalex-snapshot
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.026openalex-snapshot
The Ramsey numbers for disjoint unions of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.050openalex-snapshot
Planar unit-distance graphs having planar unit-distance complement
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.022openalex-snapshot
Configurations in projective planes and quadrilateral-star Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.064openalex-snapshot
The Ramsey number R(C8,K8)
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.025openalex-snapshot
Stability of the path–path Ramsey number
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.025openalex-snapshot
Some results on Reed’s Conjecture about ω,Δ , and χ with respect to α
inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.013openalex-snapshot
Gallai colorings of non-complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.004openalex-snapshot
Gallai–Ramsey numbers for cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.013openalex-snapshot
Vertex-disjoint triangles in K1,t -free graphs with minimum degree at least t
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.030openalex-snapshot
A note on the monotonicity of mixed Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.020openalex-snapshot
On Ramsey (K1,m,G) -minimal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.010openalex-snapshot
Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.023openalex-snapshot
On globally sparse Ramsey graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.004openalex-snapshot
Multicolor Ramsey numbers for triple systems
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.017openalex-snapshot
The Ramsey numbers of wheels versus odd cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.016openalex-snapshot
On a local similarity of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.030openalex-snapshot
Ramsey numbers of trees versus fans
inferred← citeshttps://doi.org/10.1016/j.disc.2015.07.005openalex-snapshot
Monochromatic bounded degree subgraph partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.023openalex-snapshot
The Ramsey number of generalized loose paths in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.033openalex-snapshot
Ramsey numbers involving a long path
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.012openalex-snapshot
Ramsey numbers of a fixed odd-cycle and generalized books and fans
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.005openalex-snapshot
Multicolored set multipartite Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2016.06.015openalex-snapshot
Vertex-disjoint copies of K1,3 in K1,r -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.025openalex-snapshot
Ramsey numbers for degree monotone paths
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.034openalex-snapshot
Vertex-disjoint copies of K1,t in K1,r -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.12.020openalex-snapshot
Ramsey numbers of trees and unicyclic graphs versus fans
inferred← citeshttps://doi.org/10.1016/j.disc.2017.04.004openalex-snapshot
Bounded clique cover of some sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.004openalex-snapshot
Ramsey numbers of odd cycles versus larger even wheels
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.011openalex-snapshot
A note on Ramsey numbers for Berge- G hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.04.010openalex-snapshot
Complete graphs and complete bipartite graphs without rainbow path
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112131openalex-snapshot
Monochromatic stars in rainbow K3 -free and S3+ -free colorings
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112268openalex-snapshot
New bounds on the Ramsey number r(Im,Ln)
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112332openalex-snapshot
The Schur degree of additive sets
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112567openalex-snapshot
Extremal problems and results related to Gallai-colorings
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.01.002openalex-snapshot
Advances on defective parameters in graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.12.004openalex-snapshot
The Ramsey numbers of stars versus wheels
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.12.005openalex-snapshot
A note on Ramsey numbers with two parameters
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.05.007openalex-snapshot
The Ramsey numbers R ( C m , K 7 ) and R ( C 7 , K 8 )
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.12.022openalex-snapshot
The Ramsey numbers for cycles versus wheels of even order
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.012openalex-snapshot
Fraternal augmentations, arrangeability and linear Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.03.009openalex-snapshot
On the Ramsey numbers for stars versus complete graphs
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.02.007openalex-snapshot
Lower bounds for r2(K1+G) and r3(K1+G) from Paley graph and generalization
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.018openalex-snapshot
Ramsey numbers for bipartite graphs with small bandwidth
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.08.009openalex-snapshot
Stars versus stripes Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103021openalex-snapshot
Suitable sets of permutations, packings of triples, and Ramsey’s theorem
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103347openalex-snapshot
Improved bounds on the Ramsey number of fans
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103598openalex-snapshot
Gallai–Ramsey number of odd cycles with chords
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.2017.10.005openalex-snapshot
Ramsey for complete graphs with a dropped edge or a triangle
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.09.007openalex-snapshot
On three-color Ramsey numbers R(C4,K1,,P)
inferred← citeshttps://doi.org/10.1016/j.ins.2006.12.002openalex-snapshot
A new construction technique of a triangle-free 3-colored K16’s
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2010.09.036openalex-snapshot
Equality of ordinary and symbolic powers of Stanley–Reisner ideals
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.003openalex-snapshot
Experimenting with parallelism for the instantiation of ASP programs
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.02.005openalex-snapshot
The Ramsey number for hypergraph cycles I
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.10.005openalex-snapshot
The mathematics of Bruce Rothschild
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.09.003openalex-snapshot
Ramsey numbers of 3-uniform loose paths and loose cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.09.001openalex-snapshot
The Ramsey number for a triple of long even cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.06.001openalex-snapshot
The chromatic gap and its extremes
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.07.007openalex-snapshot
Edges not in any monochromatic copy of a fixed graph
inferred← citeshttps://doi.org/10.1016/j.laa.2010.11.052openalex-snapshot
The minimum semidefinite rank of a triangle-free graph
inferred← citeshttps://doi.org/10.1016/j.laa.2014.06.033openalex-snapshot
Ramsey numbers, graph eigenvalues, and a conjecture of Cao and Yuan
inferred← citeshttps://doi.org/10.1016/j.laa.2020.09.022openalex-snapshot
On the multiplicities of normalized Laplacian eigenvalues of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00041-8openalex-snapshot
K2,2–K1,n and K2,n–K2,n bipartite Ramsey numbers
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00283-7openalex-snapshot
Lower bounds of Ramsey numbers based on cubic residues
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00837-3openalex-snapshot
Upper bounds for Ramsey numbers
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00057-xopenalex-snapshot
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00245-7openalex-snapshot
Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers
showing the first 200 of 368 · page through all 368
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.