What must be contained in every oriented k-uniform hypergraph

DOI10.1016/0012-365X(86)90219-0MaRDI QIDQ1092925zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On unavoidable hypergraphs
• The minimum number of edges in uniform hypergraphs with property O
• Induced universal hypergraphs
• Transversal numbers of uniform hypergraphs
• On universality of graphs with uniformly distributed edges

Cites work

• scientific article; zbMATH DE number 3902685 (Why is no real title available?)
• scientific article; zbMATH DE number 736291 (Why is no real title available?)
• scientific article; zbMATH DE number 3013308 (Why is no real title available?)
• Largest digraphs contained in all n-tournaments
• On Sets of Consistent Arcs in a Tournament

Cited in

(11)

• On the existence of \(k\)-tournaments with given automorphism group
• Resource-sharing systems and hypergraph colorings
• A generalization of rotational tournaments
• On score sequences of k-hypertournaments
• Kings in multipartite hypertournaments
• Note on the degree sequences of \(k\)-hypertournaments
• On the scores and degrees in hypertournaments
• Kings in bipartite hypertournaments
• The minimum number of edges in uniform hypergraphs with property O
• Degree sequences of k-multi-hypertournaments
• Kings in hypertournaments

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

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