On the public citation graph
Ramsey Theory Applications
0 signed · 265 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)1098-2418(199608/09)9:1/2<15::aid-rsa2>3.0.co;2-eopenalex-snapshot
Foundations of positional games
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.0.co;2-wopenalex-snapshot
Finding a large hidden clique in a random graph
inferredcites →https://doi.org/10.1002/9781118032718.scardopenalex-snapshot
Wiley‐Interscience Series in Discrete Mathematics and Optimization
inferredcites →https://doi.org/10.1002/j.1538-7305.1979.tb02972.xopenalex-snapshot
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
inferredcites →https://doi.org/10.1002/jgt.3190010118openalex-snapshot
Tree‐complete graph ramsey numbers
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.3190070105openalex-snapshot
A survey of bounds for classical Ramsey numbers
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/aima.2001.1983openalex-snapshot
Weakly Ramsey Sets in Banach Spaces
inferredcites →https://doi.org/10.1006/eujc.1999.0297openalex-snapshot
The Number of Monochromatic Schur Triples
inferredcites →https://doi.org/10.1006/eujc.1999.0317openalex-snapshot
Cyclic Polytopes and Oriented Matroids
inferredcites →https://doi.org/10.1006/jctb.1994.1038openalex-snapshot
Linear Programming in Some Ramsey Problems
inferredcites →https://doi.org/10.1006/jctb.1996.1741openalex-snapshot
Subgraph Counting Identities and Ramsey Numbers
inferredcites →https://doi.org/10.1006/jnth.1996.0155openalex-snapshot
On Schur Properties of Random Subsets of Integers
inferredcites →https://doi.org/10.1007/3-540-48660-7_8openalex-snapshot
VSDITLU: A Verifiable Symbolic Definite Integral Table Look-Up
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-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-0801-3openalex-snapshot
Discrete Probability and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4613-0039-7openalex-snapshot
Lectures on Discrete Geometry
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-17364-6openalex-snapshot
Extremal Combinatorics: With Applications in Computer Science
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_39openalex-snapshot
Note on a Generalization of Roth’s Theorem
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/bf00290149openalex-snapshot
Ramsey numbers and an approximation algorithm for the vertex cover problem
inferredcites →https://doi.org/10.1007/bf01171101openalex-snapshot
On Kakeya's problem and a similar one
inferredcites →https://doi.org/10.1007/bf01212974openalex-snapshot
A statistical theorem of set addition
inferredcites →https://doi.org/10.1007/bf01762109openalex-snapshot
Simulations among concurrent-write PRAMs
inferredcites →https://doi.org/10.1007/bf01840398openalex-snapshot
A better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1007/bf01876039openalex-snapshot
Generalized arithmetical progressions and sumsets
inferredcites →https://doi.org/10.1007/bf01894569openalex-snapshot
On sets of integers containing no four elements in arithmetic progression
inferredcites →https://doi.org/10.1007/bf01896663openalex-snapshot
Dvoretzky's theorem — Thirty years later
inferredcites →https://doi.org/10.1007/bf01990536openalex-snapshot
The complexity of detecting crossingfree configurations in the plane
inferredcites →https://doi.org/10.1007/bf01994876openalex-snapshot
Approximating maximum independent sets by excluding subgraphs
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1007/bf02579267openalex-snapshot
Van der waerden and ramsey type games
inferredcites →https://doi.org/10.1007/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferredcites →https://doi.org/10.1007/bf02579457openalex-snapshot
Intersection theorems with geometric consequences
inferredcites →https://doi.org/10.1007/bf02764959openalex-snapshot
A szemerédi type theorem for sets of positive density inR k
inferredcites →https://doi.org/10.1007/bf02764984openalex-snapshot
Idempotents in compact semigroups and Ramsey theory
inferredcites →https://doi.org/10.1007/bf02771597openalex-snapshot
Some remarks on number theory. II.
inferredcites →https://doi.org/10.1007/bf02773803openalex-snapshot
On a metric generalization of ramsey’s theorem
inferredcites →https://doi.org/10.1007/bf02790008openalex-snapshot
Topological dynamics and combinatorial number theory
inferredcites →https://doi.org/10.1007/bf02790016openalex-snapshot
An ergodic Szemerédi theorem for commuting transformations
inferredcites →https://doi.org/10.1007/bf02796120openalex-snapshot
A nonlinear version of Roth's theorem for sets of positive density in the real line
inferredcites →https://doi.org/10.1007/bf02801990openalex-snapshot
On hilbertian subsets of finite metric spaces
inferredcites →https://doi.org/10.1007/bf02813304openalex-snapshot
Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions
inferredcites →https://doi.org/10.1007/bf03041066openalex-snapshot
A density version of the Hales-Jewett theorem
inferredcites →https://doi.org/10.1007/bfb0030331openalex-snapshot
A lower bound on complexity of branching programs
inferredcites →https://doi.org/10.1007/bfb0030876openalex-snapshot
Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
inferredcites →https://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferredcites →https://doi.org/10.1007/bfb0081748openalex-snapshot
A few observations on the connections between local theory and some other fields
inferredcites →https://doi.org/10.1007/pl00009317openalex-snapshot
Ramsey-Type Results for Geometric Graphs, I
inferredcites →https://doi.org/10.1007/pl00009353openalex-snapshot
Forced Convex n -Gons in the Plane
inferredcites →https://doi.org/10.1007/pl00009358openalex-snapshot
Finding Convex Sets Among Points in the Plane
inferredcites →https://doi.org/10.1007/pl00009360openalex-snapshot
Canonical Theorems for Convex Sets
inferredcites →https://doi.org/10.1007/s00039-001-0332-9openalex-snapshot
A new proof of Szemerédi's theorem
inferredcites →https://doi.org/10.1007/s000390050065openalex-snapshot
A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four
inferredcites →https://doi.org/10.1007/s000390050087openalex-snapshot
On the Dimension of Kakeya Sets and Related Maximal Inequalities
inferredcites →https://doi.org/10.1007/s000390050105openalex-snapshot
On Triples in Arithmetic Progression
inferredcites →https://doi.org/10.1007/s001530050126openalex-snapshot
An existential fragment of second order logic
inferredcites →https://doi.org/10.1007/s003730200017openalex-snapshot
Ramsey-Type Results for Unions of Comparability Graphs
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/s004930100016openalex-snapshot
Ramsey-type Theorems with Forbidden Subgraphs
inferredcites →https://doi.org/10.1007/s004930200009openalex-snapshot
Positional Games and the Second Moment Method
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(74)90151-4openalex-snapshot
All Ramsey numbers for cycles in graphs
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(84)90046-3openalex-snapshot
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90057-3openalex-snapshot
On the use of senders in generalized ramsey theory for graphs
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(92)90665-3openalex-snapshot
Sets in Rd with no large empty convex subsets
inferredcites →https://doi.org/10.1016/0012-365x(92)90686-aopenalex-snapshot
Unprovable combinatorial statements
inferredcites →https://doi.org/10.1016/0020-0190(93)90246-6openalex-snapshot
A still better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1016/0022-0000(88)90002-5openalex-snapshot
Meanders and their applications in lower bounds arguments
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
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/0097-3165(74)90023-5openalex-snapshot
Finite sums from sequences within cells of a partition of N
inferredcites →https://doi.org/10.1016/0097-3165(75)90039-4openalex-snapshot
Ramsey's theorem with sums or unions
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(92)90053-wopenalex-snapshot
Quasi-random subsets of Zn
inferredcites →https://doi.org/10.1016/0097-3165(92)90103-2openalex-snapshot
A ramseyan theorem and an infinite game
inferredcites →https://doi.org/10.1016/0166-218x(84)90025-8openalex-snapshot
Applications of Ramsey theory
inferredcites →https://doi.org/10.1016/0304-3975(90)90080-2openalex-snapshot
Lower bounds to the complexity of symmetric Boolean functions
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/j.ejc.2003.08.003openalex-snapshot
Low dimensional embeddings of ultrametrics
inferredcites →https://doi.org/10.1016/j.ic.2003.09.003openalex-snapshot
On the strength of comparisons in property testing
inferredcites →https://doi.org/10.1016/s0012-365x(98)00322-7openalex-snapshot
On a question about sum-free sequences
inferredcites →https://doi.org/10.1016/s0012-365x(99)00403-3openalex-snapshot
Coloring arcs of convex sets
inferredcites →https://doi.org/10.1016/s0020-0190(97)00032-xopenalex-snapshot
Transforming comparison model lower bounds to the parallel-random-access-machine
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1016/s0049-237x(08)71130-3openalex-snapshot
A Mathematical Incompleteness in Peano Arithmetic
inferredcites →https://doi.org/10.1016/s0095-8956(73)80005-xopenalex-snapshot
Ramsey numbers for cycles in graphs
inferredcites →https://doi.org/10.1016/s0166-218x(00)00234-1openalex-snapshot
Ramsey-remainder for convex sets and the Erdős–Szekeres theorem
inferredcites →https://doi.org/10.1016/s0304-3975(00)00233-4openalex-snapshot
Generalized and geometric Ramsey numbers for cycles
inferredcites →https://doi.org/10.1016/s0304-3975(96)00020-5openalex-snapshot
Removing Ramsey theory: Lower bounds with smaller domain size
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1016/s0925-7721(97)00015-1openalex-snapshot
Universal 3-dimensional visibility representations for graphs
inferredcites →https://doi.org/10.1016/s1874-5849(03)80031-1openalex-snapshot
Ramsey Methods in Banach Spaces
inferredcites →https://doi.org/10.1017/cbo9780511623738openalex-snapshot
The Geometry of Fractal Sets
inferredcites →https://doi.org/10.1017/s002248120002795xopenalex-snapshot
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines
inferredcites →https://doi.org/10.1017/s0305004100046867openalex-snapshot
Some remarks on the Kakeya problem
inferredcites →https://doi.org/10.1017/s0963548300000936openalex-snapshot
Deterministic Graph Games and a Probabilistic Intuition
inferredcites →https://doi.org/10.1017/s0963548300001024openalex-snapshot
A Ramsey-Type Theorem in the Plane
inferredcites →https://doi.org/10.1017/s0963548300002030openalex-snapshot
A Winning Strategy for the Ramsey Graph Game
inferredcites →https://doi.org/10.1017/s0963548301004862openalex-snapshot
A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences
inferredcites →https://doi.org/10.1017/s0963548303005698openalex-snapshot
A Note on Explicit Ramsey Graphs and Modular Sieves
inferredcites →https://doi.org/10.1017/s0963548303005790openalex-snapshot
An Application of Hindman's Theorem to a Problem on Communication Complexity
inferredcites →https://doi.org/10.1023/a:1005210202899openalex-snapshot
Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets
inferredcites →https://doi.org/10.1023/a:1008374125234openalex-snapshot
Hiding Cliques for Cryptographic Security
inferredcites →https://doi.org/10.1073/pnas.32.12.331openalex-snapshot
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
inferredcites →https://doi.org/10.1073/pnas.45.2.223openalex-snapshot
A THEOREM ON CONVEX BODIES AND APPLICATIONS TO BANACH SPACES
inferredcites →https://doi.org/10.1080/00029890.1959.11989408openalex-snapshot
On Sets of Acquaintances and Strangers at any Party
inferredcites →https://doi.org/10.1090/mmono/037openalex-snapshot
Foundations of a Structural Theory of Set Addition
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08785-1openalex-snapshot
Some remarks on the theory of graphs
inferredcites →https://doi.org/10.1090/s0002-9939-02-06403-1openalex-snapshot
A Ramsey theorem for measurable sets
inferredcites →https://doi.org/10.1090/s0002-9939-1992-1095225-4openalex-snapshot
An Unprovable Ramsey-Type Theorem
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0143712-1openalex-snapshot
Regularity and positional games
inferredcites →https://doi.org/10.1090/s0002-9947-1986-0819949-8openalex-snapshot
On Type of Metric Spaces
inferredcites →https://doi.org/10.1090/s0273-0979-00-00877-6openalex-snapshot
The Erdos-Szekeres problem on points in convex position – a survey
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0929498-xopenalex-snapshot
Primitive Recursive Bounds for Van Der Waerden Numbers
inferredcites →https://doi.org/10.1090/s0894-0347-96-00194-4openalex-snapshot
Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
inferredcites →https://doi.org/10.1090/ulect/029/11openalex-snapshot
Recent work connected with the Kakeya problem
inferredcites →https://doi.org/10.1109/18.412676openalex-snapshot
Repeated communication and Ramsey graphs
inferredcites →https://doi.org/10.1109/fscs.1990.89576openalex-snapshot
Some tools for approximate 3-coloring
inferredcites →https://doi.org/10.1109/sfcs.1984.715931openalex-snapshot
Eigenvalues, Expanders And Superconcentrators
inferredcites →https://doi.org/10.1109/sfcs.1986.31openalex-snapshot
Meanders, Ramsey theory and lower bounds for branching programs
inferredcites →https://doi.org/10.1109/sfcs.2001.959914openalex-snapshot
A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1112/jlms/s1-11.4.261openalex-snapshot
On Some Sequences of Integers
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.441openalex-snapshot
On Fundamental Geometric Properties of Plane Line-Sets
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.1112/plms/s2-48.1.122openalex-snapshot
Note on Combinatorial Analysis
inferredcites →https://doi.org/10.1112/plms/s3-2.1.417openalex-snapshot
Combinatorial Theorems on Classifications of Subsets of a Given Set
inferredcites →https://doi.org/10.1112/s0025579300009979openalex-snapshot
Sections of Sets of zero Lebesgue measure
inferredcites →https://doi.org/10.1137/0118004openalex-snapshot
Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1137/0404022openalex-snapshot
Noncrossing Subgraphs in Topological Layouts
inferredcites →https://doi.org/10.1137/0605030openalex-snapshot
Explicit Concentrators from Generalized N -Gons
inferredcites →https://doi.org/10.1137/s0097539790181336openalex-snapshot
Subquadratic Simulations of Balanced Formulae by Branching Programs
inferredcites →https://doi.org/10.1137/s0097539793254571openalex-snapshot
What Can be Computed Locally?
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0895480101384086openalex-snapshot
Asymptotic Size Ramsey Results for Bipartite Graphs
inferredcites →https://doi.org/10.1142/9789812562494_0014openalex-snapshot
THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING
inferredcites →https://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferredcites →https://doi.org/10.1145/2157.2158openalex-snapshot
Improving the performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1145/22145.22151openalex-snapshot
One, two, three . . . infinity: lower bounds for parallel computation
inferredcites →https://doi.org/10.1145/301250.301411openalex-snapshot
Graph Ramsey theory and the polynomial hierarchy
inferredcites →https://doi.org/10.1145/4221.4259openalex-snapshot
Applications of Ramsey's theorem to decision tree complexity
inferredcites →https://doi.org/10.1145/73007.73037openalex-snapshot
Optimal separations between concurrent-write parallel machines
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
inferredcites →https://doi.org/10.1145/772062.772065openalex-snapshot
Typechecking XML views of relational databases
inferredcites →https://doi.org/10.1215/s0012-7094-02-11331-3openalex-snapshot
A polynomial bound in Freiman's theorem
inferredcites →https://doi.org/10.1215/s0012-7094-02-11422-7openalex-snapshot
On arithmetic structures in dense sets of integers
inferredcites →https://doi.org/10.1515/9781400855162openalex-snapshot
Recurrence in Ergodic Theory and Combinatorial Number Theory
inferredcites →https://doi.org/10.2140/pjm.1971.37.45openalex-snapshot
Ramsey bounds for graph products
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.2307/2323620openalex-snapshot
Winning Ways for Your Mathematical Plays.
inferredcites →https://doi.org/10.2307/2661389openalex-snapshot
An Improved Bound on the Minkowski Dimension of Besicovitch Sets in ℝ 3
inferredcites →https://doi.org/10.2307/2695493openalex-snapshot
The Interactive Geometry Software Cinderella
inferredcites →https://doi.org/10.2307/3597282openalex-snapshot
An Infinite Ramsey Theorem and Some Banach-Space Dichotomies
inferredcites →https://doi.org/10.37236/1188openalex-snapshot
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
inferredcites →https://doi.org/10.37236/1189openalex-snapshot
The independence number of graphs with large odd girth
inferredcites →https://doi.org/10.37236/1192openalex-snapshot
Explicit Ramsey graphs and orthonormal labelings
inferredcites →https://doi.org/10.37236/1221openalex-snapshot
The Independence Number of Dense Graphs with Large Odd Girth
inferredcites →https://doi.org/10.37236/1230openalex-snapshot
Applying Tabu Search to Determine New Ramsey Graphs
inferredcites →https://doi.org/10.37236/1329openalex-snapshot
Monotonic subsequences in dimensions higher than one.
inferredcites →https://doi.org/10.37236/1345openalex-snapshot
All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9
inferredcites →https://doi.org/10.37236/1357openalex-snapshot
A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less!
showing the first 200 of 215 · page through all 215
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.4883109openalex-extracted
Ramsey Achievement Games on Graphs: Algorithms and Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-031-36027-5_46openalex-snapshot
Applying Reinforcement Learning to Ramsey Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_18openalex-snapshot
The Complexity of $$(P_k, P_\ell )$$-Arrowing
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_4openalex-snapshot
On Some Open Questions for Ramsey and Folkman Numbers
inferred← citeshttps://doi.org/10.1007/s00283-014-9508-7openalex-snapshot
F. P. Ramsey: The Theory, the Myth, and the Mirror
inferred← citeshttps://doi.org/10.1007/s00373-009-0847-7openalex-snapshot
On Geometric Graph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s11063-022-11099-8openalex-snapshot
Ramsey’s Theory Meets the Human Brain Connectome
inferred← citeshttps://doi.org/10.1007/s11786-015-0244-yopenalex-snapshot
Matching-Star Ramsey Minimal 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.dam.2014.05.007openalex-snapshot
On the van der Waerden numbers w(2;3,t)
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.2024.11.001openalex-snapshot
Ramsey and Gallai–Ramsey numbers for comb and sun graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.029openalex-snapshot
Ramsey and Gallai–Ramsey numbers for multiple triangles of graphs and their multiplicities
inferred← citeshttps://doi.org/10.1016/j.heliyon.2022.e11431openalex-snapshot
Some results on the multipartite Ramsey numbers m(C3,C,n1K2,n2K2,…,nK2)
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.jcss.2025.103726openalex-snapshot
The complexity of (P,P)-arrowing
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103843openalex-snapshot
The Shannon capacity and a new lower bound for multicolored Ramsey numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.08.008openalex-snapshot
Disjointness graphs of short polygonal chains
inferred← citeshttps://doi.org/10.1103/physrevlett.108.010501openalex-snapshot
Ramsey Numbers and Adiabatic Quantum Computing
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00119openalex-snapshot
Ramsey Theorems for Trees and a General ‘Private Learning Implies Online Learning’ Theorem
inferred← citeshttps://doi.org/10.1109/msp.2013.68openalex-snapshot
Ramsey theory: Learning about the needle in the haystack
inferred← citeshttps://doi.org/10.1109/tit.2013.2256951openalex-snapshot
Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
inferred← citeshttps://doi.org/10.1112/plms/pdu049openalex-snapshot
The Erdős-Gyárfás problem on generalized Ramsey numbers
inferred← citeshttps://doi.org/10.1142/s1793830922500999openalex-snapshot
The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2)
inferred← citeshttps://doi.org/10.1145/2184512.2184576openalex-snapshot
Parallel search for Ramsey grid colorings
inferred← citeshttps://doi.org/10.1155/2020/7069730openalex-snapshot
On Generalized Schur Numbers of the Equation x+ay=z
inferred← citeshttps://doi.org/10.1515/integ.2009.052openalex-snapshot
On Rainbow Solutions to an Equation with a Quadratic Term
inferred← citeshttps://doi.org/10.15439/2023f8192openalex-snapshot
Star-critical Ramsey numbers for hexagon
inferred← citeshttps://doi.org/10.1587/transfun.2021dmp0003openalex-snapshot
Ramsey Numbers of Trails
inferred← citeshttps://doi.org/10.17977/um055v2i12021p14-18openalex-snapshot
BEBERAPA KELAS GRAF RAMSEY MINIMAL UNTUK LINTASAN P_3 VERSUS P_5
inferred← citeshttps://doi.org/10.20429/tag.2023.10109openalex-snapshot
New Diagonal Graph Ramsey Numbers of Unicyclic Graphs
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.1025openalex-snapshot
On the Ramsey Numbers for Trees versus Fans
inferred← citeshttps://doi.org/10.22369/issn.2153-4136/3/2/6openalex-snapshot
A Performance Comparison of a Naive Algorithm to Solve the Party Problem using GPUs
inferred← citeshttps://doi.org/10.26493/2590-9770.1573.7b1openalex-snapshot
Multipartite Ramsey number of complete graphs versus matchings
inferred← citeshttps://doi.org/10.31274/etd-180810-267openalex-snapshot
problems in graph theory and probability
inferred← citeshttps://doi.org/10.3990/1.9789036538329openalex-snapshot
Generalized Ramsey numbers for graphs
inferred← citeshttps://doi.org/10.3990/1.9789036552486openalex-snapshot
Gallai-Ramsey numbers for graphs and their generalizations
inferred← citeshttps://doi.org/10.46298/dmtcs.11207openalex-snapshot
The bipartite Ramsey numbers $BR(C_8, C_{2n})$
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3347openalex-snapshot
Proving programs terminate using well orderings, Ramsey Theory, and Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01878openalex-snapshot
Upper Bounds for Ordered Ramsey Numbers of Small 1-Orderings
inferred← citeshttps://doi.org/10.5614/ejgta.2013.1.2.2openalex-snapshot
Bipartite Ramsey numbers involving stars, stripes and trees
inferred← citeshttps://doi.org/10.5614/ejgta.2021.9.2.24openalex-snapshot
A note on the Ramsey number for cycle with respect to multiple copies of wheels
inferred← citeshttps://doi.org/10.5614/ejgta.2022.10.2.17openalex-snapshot
Computation of new diagonal graph Ramsey numbers
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.