On the public citation graph
The size Ramsey number
0 signed · 210 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/bimj.19730150411openalex-snapshot
RÉNYI, A. : Foundations of Probability. Holden‐Day, Inc., San Francisco 1970. XVI, 366 S., $ 20,00.
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bfb0060112openalex-snapshot
A many-facetted problem of zarankiewicz
inferredcites →https://doi.org/10.1007/springerreference_205344openalex-snapshot
Foundations of Probability
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)90081-7openalex-snapshot
Path-path Ramsey-type numbers for the complete bipartite graph
inferredcites →https://doi.org/10.1016/0097-3165(75)90007-2openalex-snapshot
A problem of Zarankiewicz
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0409255-0openalex-snapshot
Ramsey theorems for multiple copies 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.2139/ssrn.4979021openalex-extracted
On the Size Multipartite Ramsey Numbers Involving Complete Graphs
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1002/jgt.10086openalex-snapshot
Size ramsey numbers of stars versus 4‐chromatic 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.22115openalex-snapshot
On the Size‐Ramsey Number of Hypergraphs
inferred← citeshttps://doi.org/10.1002/jgt.22432openalex-snapshot
The size‐Ramsey number of powers of paths
inferred← citeshttps://doi.org/10.1002/jgt.22445openalex-snapshot
Online Ramsey theory for a triangle on ‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.22453openalex-snapshot
Size Ramsey numbers of stars versus cliques
inferred← citeshttps://doi.org/10.1002/jgt.22832openalex-snapshot
Multicolor list Ramsey numbers grow exponentially
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.3190070107openalex-snapshot
Size Ramsey numbers for small‐order graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190070115openalex-snapshot
On size Ramsey number of paths, trees, and circuits. I
inferred← citeshttps://doi.org/10.1002/rsa.10081openalex-snapshot
Regular pairs in sparse random graphs I
inferred← citeshttps://doi.org/10.1002/rsa.20780openalex-snapshot
Monochromatic paths in random tournaments
inferred← citeshttps://doi.org/10.1002/rsa.20783openalex-snapshot
The size Ramsey number of short subdivisions of bounded degree graphs
inferred← citeshttps://doi.org/10.1002/rsa.20995openalex-snapshot
The size‐Ramsey number of short subdivisions
inferred← citeshttps://doi.org/10.1002/rsa.3240040106openalex-snapshot
The size Ramsey number of trees with bounded degree
inferred← citeshttps://doi.org/10.1002/rsa.70059openalex-snapshot
Size‐Ramsey Numbers of Structurally Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_8openalex-snapshot
Problems in Graph Theory from Memphis
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_6openalex-snapshot
On Induced Online Ramsey Number of Paths, Cycles, and Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_51openalex-snapshot
Star-Critical Ramsey Number of Large Cycle and Book
inferred← citeshttps://doi.org/10.1007/978-3-031-29981-0_1openalex-snapshot
Introduction to Multicolor Star-Critical Ramsey Numbers
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-0348-5438-2_25openalex-snapshot
Generalized ramsey theory VIII. The size ramsey number of small graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_23openalex-snapshot
How Many Conflicts Does It Need to Be Unsatisfiable?
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_2openalex-snapshot
Problems in Graph Theory from Memphis
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_4openalex-snapshot
On Size Ramsey Number of Paths, Trees and Circuits. II
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_4openalex-snapshot
Online Ramsey Numbers and the Subgraph Query Problem
inferred← citeshttps://doi.org/10.1007/bf01849031openalex-snapshot
Remarks on the size Ramsey number of graphs
inferred← citeshttps://doi.org/10.1007/bfb0070372openalex-snapshot
Some extremal problems for simple two-complexes
inferred← citeshttps://doi.org/10.1007/pl00009317openalex-snapshot
Ramsey-Type Results for Geometric Graphs, I
inferred← citeshttps://doi.org/10.1007/s00373-021-02337-2openalex-snapshot
Star-Critical Ramsey Numbers of Generalized Fans
inferred← citeshttps://doi.org/10.1007/s00373-021-02398-3openalex-snapshot
Size Ramsey Results for the Path of Order Three
inferred← citeshttps://doi.org/10.1007/s00493-009-2264-1openalex-snapshot
Coloring number and on-line Ramsey theory for graphs and hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-019-3921-7openalex-snapshot
Packing Nearly Optimal Ramsey R(3,t) Graphs
inferred← citeshttps://doi.org/10.1007/s00493-021-4409-9openalex-snapshot
Ramsey Numbers of Books and Quasirandomness
inferred← citeshttps://doi.org/10.1007/s00493-023-00034-7openalex-snapshot
Three Early Problems on Size Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00493-023-00056-1openalex-snapshot
On Bounded Degree Graphs with Large Size-Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00493-024-00103-5openalex-snapshot
Effective Bounds for Induced Size-Ramsey Numbers of Cycles
inferred← citeshttps://doi.org/10.1007/s00493-026-00202-5openalex-snapshot
Explicit Constructions of Optimal Blocking Sets and Minimal Codes
inferred← citeshttps://doi.org/10.1007/s10255-021-1047-3openalex-snapshot
Lower Bounds of Size Ramsey Number for Graphs with Small Independence Number
inferred← citeshttps://doi.org/10.1007/s10255-022-1023-6openalex-snapshot
Star-critical Ramsey Numbers of Wheels Versus Odd Cycles
inferred← citeshttps://doi.org/10.1007/s10878-017-0214-1openalex-snapshot
Sparse multipartite graphs as partition universal for graphs with bounded degree
inferred← citeshttps://doi.org/10.1007/s10878-025-01312-4openalex-snapshot
On some path-critical Ramsey numbers
inferred← citeshttps://doi.org/10.1007/s12044-017-0366-zopenalex-snapshot
Connected size Ramsey number for matchings vs. small stars or cycles
inferred← citeshttps://doi.org/10.1007/s40840-021-01130-xopenalex-snapshot
A Note on On-Line Ramsey Numbers of Stars and Paths
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/0012-365x(83)90248-0openalex-snapshot
Size Ramsey numbers involving stars
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90034-yopenalex-snapshot
Graph properties and hypergraph colourings
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90521-topenalex-snapshot
The size Ramsey number of a complete bipartite graph
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90017-7openalex-snapshot
Local k-colorings of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/1385-7258(78)90036-7openalex-snapshot
Ramsey-minimal graphs for multiple copies
inferred← citeshttps://doi.org/10.1016/b978-0-444-86893-0.50019-xopenalex-snapshot
SIZE RAMSEY NUMBERS INVOLVING MATCHINGS
inferred← citeshttps://doi.org/10.1016/j.aim.2011.01.004openalex-snapshot
Sparse partition universal graphs for graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.amc.2019.125006openalex-snapshot
Minimal Ramsey graphs on deleting stars for generalized fans and books
inferred← citeshttps://doi.org/10.1016/j.dam.2007.10.020openalex-snapshot
On multicolour noncomplete Ramsey graphs of star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.007openalex-snapshot
Star-critical Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.014openalex-snapshot
Some star-critical 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.2019.02.002openalex-snapshot
Ordered size Ramsey number of paths
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.011openalex-snapshot
Multicolor induced Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.067openalex-snapshot
On size multipartite Ramsey numbers involving complete graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.048openalex-snapshot
On some critical Ramsey numbers involving paths
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.025openalex-snapshot
Explicit construction of linear sized tolerant networks
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.060openalex-snapshot
Size bipartite Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.011openalex-snapshot
Size Ramsey numbers for some regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.09.015openalex-snapshot
Some Ramsey–Turán type problems and related questions
inferred← citeshttps://doi.org/10.1016/j.disc.2016.02.001openalex-snapshot
The vertex size-Ramsey number
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.016openalex-snapshot
Degree Ramsey numbers for even cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111743openalex-snapshot
Deleting edges from Ramsey graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111899openalex-snapshot
On the multicolor size Ramsey number of stars and cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112427openalex-snapshot
Ramsey numbers of large books and bipartite graphs with small bandwidth
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113479openalex-snapshot
Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115430openalex-snapshot
New bounds on the size-Ramsey numbers of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.08.004openalex-snapshot
Degree Ramsey numbers for cycles and blowups of trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103103openalex-snapshot
The oriented size Ramsey number of directed paths
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103200openalex-snapshot
An analogue of the Erdős–Gallai theorem for random graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103242openalex-snapshot
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
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.2023.103785openalex-snapshot
New upper bounds for Ramsey numbers of books
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.007openalex-snapshot
Size Ramsey numbers for some regular graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.005openalex-snapshot
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.036openalex-snapshot
Monochromatic paths in random tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.10.002openalex-snapshot
The size Ramsey number of a directed path
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.03.006openalex-snapshot
On the minimum degree of minimal Ramsey graphs for multiple colours
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.12.007openalex-snapshot
An algorithmic framework for obtaining lower bounds for random Ramsey problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.06.004openalex-snapshot
The multicolour size-Ramsey number of powers of paths
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.10.003openalex-snapshot
The multicolor size-Ramsey numbers of cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.05.006openalex-snapshot
On the use of senders for asymmetric tuples of cliques in Ramsey theory
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.08.004openalex-snapshot
Triangle Ramsey numbers of complete graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2015.12.069openalex-snapshot
On The Restricted Size Ramsey Number
inferred← citeshttps://doi.org/10.1016/j.procs.2015.12.071openalex-snapshot
Connected Size Ramsey Numbers for Matchings versus Cycles or Paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.019openalex-snapshot
Complete bipartite graphs deleted in Ramsey graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.004openalex-snapshot
Star-critical Ramsey number of large cycle and book of different orders
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00046-5openalex-snapshot
On bounds for size Ramsey numbers of a complete tripartite graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70766-0openalex-snapshot
Explicit Construction of Linear Sized Tolerant Networks
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80038-3openalex-snapshot
On Finite Ramsey Numbers
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73554-0openalex-snapshot
Achievement and Avoidance Games for Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.003openalex-snapshot
Recent developments in graph Ramsey theory
inferred← citeshttps://doi.org/10.1017/fms.2023.6openalex-snapshot
Ramsey numbers of cycles versus general graphs
inferred← citeshttps://doi.org/10.1017/s0963548300001619openalex-snapshot
The Induced Size-Ramsey Number of Cycles
inferred← citeshttps://doi.org/10.1017/s0963548305006929openalex-snapshot
Book Ramsey Numbers and Quasi-Randomness
inferred← citeshttps://doi.org/10.1017/s0963548311000617openalex-snapshot
Degree Ramsey Numbers of Graphs
inferred← citeshttps://doi.org/10.1017/s0963548313000151openalex-snapshot
Size Ramsey Number of Bounded Degree Graphs for Games
inferred← citeshttps://doi.org/10.1017/s096354831400056xopenalex-snapshot
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
inferred← citeshttps://doi.org/10.1017/s0963548315000395openalex-snapshot
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1017/s0963548319000221openalex-snapshot
On the Size-Ramsey Number of Cycles
inferred← citeshttps://doi.org/10.1017/s0963548320000322openalex-snapshot
On the size-Ramsey number of grid graphs
inferred← citeshttps://doi.org/10.1017/s0963548322000013openalex-snapshot
Short proofs for long induced paths
inferred← citeshttps://doi.org/10.1017/s0963548322000360openalex-snapshot
Off-diagonal book Ramsey numbers
inferred← citeshttps://doi.org/10.1017/s0963548323000147openalex-snapshot
On the size-Ramsey number of grids
inferred← citeshttps://doi.org/10.1017/s0963548324000026openalex-snapshot
On a conjecture of Conlon, Fox, and Wigderson
inferred← citeshttps://doi.org/10.1023/b:mahu.0000010820.93968.2bopenalex-snapshot
Remarks on a paper by H. Bielak on size Ramsey numbers
inferred← citeshttps://doi.org/10.1051/ita:2005019openalex-snapshot
A note on the Size-Ramsey number of long subdivisions of graphs
inferred← citeshttps://doi.org/10.1063/1.4940816openalex-snapshot
Connected size Ramsey numbers of matchings and stars
inferred← citeshttps://doi.org/10.1063/1.4940821openalex-snapshot
Restricted size Ramsey number for P3 versus small paths
inferred← citeshttps://doi.org/10.1063/1.4991240openalex-snapshot
Restricted size Ramsey number for P3 versus dense connected graphs of order six
inferred← citeshttps://doi.org/10.1063/5.0196064openalex-snapshot
Ramsey minimal graphs for 2-matching versus 5-vertex graph
inferred← citeshttps://doi.org/10.1080/09720529.2021.2000153openalex-snapshot
Two types of size Ramsey numbers for matchings of small order
inferred← citeshttps://doi.org/10.1088/1742-6596/1008/1/012034openalex-snapshot
Restricted Size Ramsey Number for 2K2versus Dense Connected Graphs of Order Six
inferred← citeshttps://doi.org/10.1088/1742-6596/1538/1/012010openalex-snapshot
On Ramsey (P 3, C 7)-minimal graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1538/1/012011openalex-snapshot
On Ramsey (P 3, C 6)-minimal graphs for certain order
inferred← citeshttps://doi.org/10.1088/1742-6596/1722/1/012048openalex-snapshot
Restricted size Ramsey number for 2K 2 versus disconnected graphs of order six
inferred← citeshttps://doi.org/10.1088/1742-6596/1725/1/012098openalex-snapshot
The size Ramsey and connected size Ramsey numbers for matchings versus paths
inferred← citeshttps://doi.org/10.1090/proc/17243openalex-snapshot
Induced Ramsey problems for trees and graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1090/tran/8660openalex-snapshot
Rolling backwards can move you forward: On embedding problems in sparse expanders
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.1112/blms.12682openalex-snapshot
The size‐Ramsey number of cubic graphs
inferred← citeshttps://doi.org/10.1112/jlms.12408openalex-snapshot
The size‐Ramsey number of powers of bounded degree trees
inferred← citeshttps://doi.org/10.1112/jlms.70116openalex-snapshot
Size‐Ramsey numbers of graphs with maximum degree three
inferred← citeshttps://doi.org/10.1137/18m1170546openalex-snapshot
On the Size-Ramsey Number of Tight Paths
inferred← citeshttps://doi.org/10.1137/20m1335790openalex-snapshot
The Size Ramsey Number of Graphs with Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/20m1365867openalex-snapshot
Ramsey Numbers Involving Large Books
inferred← citeshttps://doi.org/10.1137/23m1558239openalex-snapshot
Ramsey Equivalence for Asymmetric Pairs of Graphs
inferred← citeshttps://doi.org/10.1137/23m156183xopenalex-snapshot
Online Ramsey Numbers: Long versus Short Cycles
inferred← citeshttps://doi.org/10.1137/25m1807915openalex-snapshot
Recent Progress in Graph Theory Using Expansion
inferred← citeshttps://doi.org/10.1137/s0895480101384086openalex-snapshot
Asymptotic Size Ramsey Results for Bipartite Graphs
inferred← citeshttps://doi.org/10.1142/s1793557124501365openalex-snapshot
Size Ramsey numbers of forests versus brooms
inferred← citeshttps://doi.org/10.1145/237218.237405openalex-snapshot
Ramsey-type results for geometric graphs
inferred← citeshttps://doi.org/10.17169/refubium-8132openalex-snapshot
Orientation Games and Minimal Ramsey Graphs
inferred← citeshttps://doi.org/10.18452/13975openalex-snapshot
Regular partitions of hypergraphs and property testing
inferred← citeshttps://doi.org/10.19086/aic.2023.4openalex-snapshot
Ramsey goodness of books revisited
inferred← citeshttps://doi.org/10.21136/mb.2020.0174-18openalex-snapshot
A note on the size Ramsey numbers for matchings versus cycles
inferred← citeshttps://doi.org/10.2139/ssrn.5116548openalex-snapshot
Structural Properties of Edge-Colorings for the Existence of Multicolored Subgraphs
inferred← citeshttps://doi.org/10.26493/1855-3974.3081.d6copenalex-snapshot
On a conjecture of Erdős on size Ramsey number of star forests
inferred← citeshttps://doi.org/10.26493/2590-9770.1530.79copenalex-snapshot
Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
inferred← citeshttps://doi.org/10.3389/fphy.2020.00350openalex-snapshot
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
inferred← citeshttps://doi.org/10.37236/1012openalex-snapshot
A Bound for Size Ramsey Numbers of Multi-partite Graphs
inferred← citeshttps://doi.org/10.37236/4097openalex-snapshot
On-line Ramsey Numbers of Paths and Cycles
inferred← citeshttps://doi.org/10.37236/623openalex-snapshot
On-line Ramsey Theory for Bounded Degree Graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-005951186openalex-snapshot
Extremal colorings and extremal satisfiability
inferred← citeshttps://doi.org/10.3929/ethz-a-007052734openalex-snapshot
Combinatorial Games on Graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-007230480openalex-snapshot
Ramsey games in random graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-010020029openalex-snapshot
Ramsey properties of random graphs and hypergraphs
inferred← citeshttps://doi.org/10.3934/math.2023406openalex-snapshot
A proof of a conjecture on matching-path connected size Ramsey number
inferred← citeshttps://doi.org/10.4274/eamr.galenos.2022.27147openalex-snapshot
Maculopapular Drug Eruptions: Diversity of Histopathological Changes
inferred← citeshttps://doi.org/10.4310/joc.2014.v5.n1.a4openalex-snapshot
Online and size anti-Ramsey numbers
inferred← citeshttps://doi.org/10.4310/joc.2017.v8.n1.a7openalex-snapshot
Circular chromatic Ramsey number
inferred← citeshttps://doi.org/10.4310/joc.2023.v14.n2.a6openalex-snapshot
Lower bound on the size-Ramsey number of tight paths
inferred← citeshttps://doi.org/10.46298/dmtcs.427openalex-snapshot
On-line Ramsey numbers for paths and stars
inferred← citeshttps://doi.org/10.48550/arxiv.1311.0539openalex-snapshot
Online and size anti-Ramsey numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6966openalex-snapshot
Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06304openalex-snapshot
On the size-Ramsey number of hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1706.08134openalex-snapshot
Restricted size Ramsey number for $P_3$ versus cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1712.03226openalex-snapshot
Redundant edges in Ramsey graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08885openalex-snapshot
Note on the multicolour size-Ramsey number for paths
inferred← citeshttps://doi.org/10.48550/arxiv.1810.10160openalex-snapshot
A note on the size Ramsey number of powers of paths
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01658openalex-snapshot
A Ramsey problem related to butterfly graph vs. proper connected subgraphs of K4
inferred← citeshttps://doi.org/10.48550/arxiv.1906.08234openalex-snapshot
On edge-ordered Ramsey numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2103.01942openalex-snapshot
Size-Ramsey numbers of powers of hypergraph trees and long subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2106.16023openalex-snapshot
Multicolor Size-Ramsey Number of Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.2111.02065openalex-snapshot
On a Conjecture of Erd\H os on Size Ramsey Number of Star Forests
inferred← citeshttps://doi.org/10.5555/545381.545424openalex-snapshot
Mixing time and long paths in graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2016.4.2.4openalex-snapshot
Size multipartite Ramsey numbers for stripes versus small cycles
inferred← citeshttps://doi.org/10.5614/ejgta.2022.10.1.15openalex-snapshot
Diagonal Ramsey numbers in multipartite graphs related to stars
inferred← citeshttps://doi.org/10.5614/j.math.fund.sci.2020.52.2.1openalex-snapshot
Restricted Size Ramsey Number Involving Matching and Graph of Order Five
inferred← citeshttps://doi.org/10.5753/etc.2017.3198openalex-snapshot
Número de Ramsey relativo a arestas de potências de caminhos
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-002openalex-snapshot
Partition Universality for Hypergraphs of Bounded Degeneracy and Degree
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-027openalex-snapshot
Effective bounds for induced size-Ramsey numbers of cycles
inferred← citeshttps://doi.org/10.7151/dmgt.1268openalex-snapshot
Two variants of the size Ramsey number
inferred← citeshttps://doi.org/10.7151/dmgt.2188openalex-snapshot
On the restricted size Ramsey number involving a path P_3
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.