Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

DOI10.1016/J.ENDM.2015.06.005MaRDI QIDQ322181zbMATH OpenOpenAlexFDO

Authors Dennis Clemens, Yury Person

Publication date 14 October 2016

Full work available at URL https://arxiv.org/abs/1502.01147

zbMATH Keywords

minimal Ramsey hypergraphminimum degree and codegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Abstract: A uniform hypergraph $H$ is called $k$-Ramsey for a hypergraph $F$, if no matter how one colors the edges of $H$ with $k$ colors, there is always a monochromatic copy of $F$. We say that $H$ is minimal $k$-Ramsey for $F$, if $H$ is $k$-Ramsey for $F$ but every proper subhypergraph of $H$ is not. Burr, ErdH{o}s and Lovasz studied various parameters of minimal Ramsey graphs. In this paper we initiate the study of minimum degrees and codegrees of minimal Ramsey $3$-uniform hypergraphs. We show that the smallest minimum vertex degree over all minimal $k$-Ramsey $3$-uniform hypergraphs for $K_t^{(3)}$ is exponential in some polynomial in $k$ and $t$. We also study the smallest possible minimum codegrees over minimal $2$-Ramsey $3$-uniform hypergraphs.

Recommendations

• Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
• On the minimum degree of minimal Ramsey graphs for multiple colours
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• On the minimum degree of minimal Ramsey graphs
• Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs

Cites work

• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3520447 (Why is no real title available?)
• A new upper bound for diagonal Ramsey numbers
• Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
• On Ramsey Minimal Graphs
• On the minimum degree of minimal Ramsey graphs
• On the minimum degree of minimal Ramsey graphs for multiple colours
• On the use of senders in generalized Ramsey theory for graphs
• Ramsey's theorem - a new lower bound
• The minimum degree of Ramsey-minimal graphs
• The size Ramsey number
• What is Ramsey-equivalent to a clique?

Cited in

(5)

• On the minimum degree of minimal Ramsey graphs for multiple colours
• Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
• Big Ramsey degrees of 3-uniform hypergraphs are finite
• Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
• Codegree thresholds for covering 3-uniform hypergraphs

This page was built for publication: Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322181)