Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
From MaRDI portal
(Redirected from Publication:5366925)
Recommendations
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- On the minimum degree of minimal Ramsey graphs for multiple colours
- The minimum degree of Ramsey-minimal graphs
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Minimum degrees of minimal Ramsey graphs for almost-cliques
Cites work
- A new upper bound for diagonal Ramsey numbers
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3520447 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- On chromatic number of graphs and set-systems
- On Ramsey Minimal Graphs
- On the minimum degree of minimal Ramsey graphs
- On the use of senders in generalized Ramsey theory for graphs
- Ramsey's theorem - a new lower bound
- Recent developments in graph Ramsey theory
- The minimum degree of Ramsey-minimal graphs
- The size Ramsey number
- What is Ramsey-equivalent to a clique?
Cited in
(3)
This page was built for publication: Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366925)
