Degrees in oriented hypergraphs and sparse Ramsey theory
From MaRDI portal
Abstract: Let be an -uniform hypergraph. When is it possible to orient the edges of in such a way that every -set of vertices has some -degree equal to ? (The -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 large (for given ), but false in general. Our counterexample is based on a new technique in sparse Ramsey theory that may be of independent interest.
Recommendations
Cites work
- scientific article; zbMATH DE number 4023329 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number
- On the degrees of the vertices of a directed graph
- Partitions of finite relational and set systems
- Regularity and Positional Games
Cited in
(2)
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)