Degrees in oriented hypergraphs and sparse Ramsey theory

DOI10.1016/J.JCTA.2014.08.001zbMATH Open1301.05243arXiv1311.7082OpenAlexW2065175971MaRDI QIDQ458290FDOQ458290

Vytautas Gruslys

Publication date: 7 October 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Let $G$ be an $r$-uniform hypergraph. When is it possible to orient the edges of $G$ in such a way that every $p$-set of vertices has some $p$-degree equal to $0$? (The $p$-degrees generalise for sets of vertices what in-degree and out-degree are for single vertices in directed graphs.) Caro and Hansberg asked if the obvious Hall-type necessary condition is also sufficient. Our main aim is to show that this is true for $r$ large (for given $p$), but false in general. Our counterexample is based on a new technique in sparse Ramsey theory that may be of independent interest.

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

Recommendations

• Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number
• Equitable orientations of sparse uniform hypergraphs
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• On the Ramsey number of sparse 3-graphs
• Degree sequence of oriented \(k\)-hypergraphs

zbMATH Keywords

amalgamationoriented hypergraphset mapping

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Cites Work

• Partitions of finite relational and set systems
• On the degrees of the vertices of a directed graph
• Title not available (Why is that?)
• Regularity and Positional Games
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Title not available (Why is that?)
• Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number

Cited In (1)

• Degree sequence of oriented \(k\)-hypergraphs

This page was built for publication: Degrees in oriented hypergraphs and sparse Ramsey theory

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