Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The minimum degree of Ramsey-minimal graphs

From MaRDI portal
Publication:3422133
Jump to:navigation, search

DOI10.1002/jgt.20199zbMath1109.05077OpenAlexW4248191427MaRDI QIDQ3422133

Kathy Lin, Jacob Fox

Publication date: 9 February 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20199


zbMATH Keywords

Ramseycritical


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)


Related Items (13)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Small minimal $(3, 3)$-Ramsey graphs ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ On globally sparse Ramsey graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ What is Ramsey-equivalent to a clique? ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques




This page was built for publication: The minimum degree of Ramsey-minimal graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3422133&oldid=16719937"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 18:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki