Ramsey Equivalence for Asymmetric Pairs of Graphs
From MaRDI portal
Publication:6146270
DOI10.1137/23m1558239zbMath1530.05188arXiv2206.03898OpenAlexW4390582571MaRDI QIDQ6146270
Pranshu Gupta, Simona Boyadzhiyska, Jonathan Rollin, Dennis Clemens
Publication date: 10 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.03898
Cites Work
- Unnamed Item
- Unnamed Item
- What is Ramsey-equivalent to a clique?
- On the use of senders in generalized Ramsey theory for graphs
- Ramsey-minimal graphs for star-forests
- Ramsey-minimal graphs for forests
- The Ramsey property for graphs with forbidden complete subgraphs
- The size Ramsey number
- Regular factors of simple regular graphs and factor-spectra
- Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
- Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
- On the minimum degree of minimal Ramsey graphs
- Recent developments in graph Ramsey theory
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
- Threshold Functions for Ramsey Properties
- On minimal Ramsey graphs and Ramsey equivalence in multiple colours
- Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
- Cycle-Complete Ramsey Numbers
- Large-scale structures in random graphs
- Conditions on Ramsey Nonequivalence
- On chromatic number of graphs and set-systems
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Reguläre Faktoren von Graphen.
- The Factors of Graphs
- On Ramsey minimal graphs
- Chromatic number is Ramsey distinguishing
This page was built for publication: Ramsey Equivalence for Asymmetric Pairs of Graphs
