What must be contained in every oriented k-uniform hypergraph

DOI10.1016/0012-365X(86)90219-0zbMath0628.05050OpenAlexW2093167710MaRDI QIDQ1092925

Peter Frankl

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90219-0

zbMATH Keywords

oriented hypergraphunavoidable subhypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (10)

Kings in hypertournaments ⋮ A generalization of rotational tournaments ⋮ On the existence of \(k\)-tournaments with given automorphism group ⋮ Kings in multipartite hypertournaments ⋮ Resource-sharing systems and hypergraph colorings ⋮ On the scores and degrees in hypertournaments ⋮ Kings in bipartite hypertournaments ⋮ Note on the degree sequences of \(k\)-hypertournaments ⋮ Degree sequences of \(k\)-multi-hypertournaments ⋮ On score sequences of \(k\)-hypertournaments

Cites Work

• Largest digraphs contained in all n-tournaments
• On Sets of Consistent Arcs in a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: What must be contained in every oriented k-uniform hypergraph