On set representation of bounded degree hypergaphs

DOI10.37236/12845MaRDI QIDQ7016785zbMATH OpenFDO

Authors Ayush Basu, Griffin Johnston, Vojtěch Rödl, Marcelo Tadeu Sales

Publication date 6 March 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12845

zbMATH Keywords

bounded degree \(r\)-uniform hypergraphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• Covering graphs by the minimum number of equivalence relations
• Dividing a graph by degrees
• Graphs of small dimensions
• scientific article; zbMATH DE number 970797 (Why is no real title available?)
• Set intersection representations for almost all graphs
• Some results and problems on clique coverings of hypergraphs
• Sur deux propriétés des classes d'ensembles
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• The Representation of a Graph by Set Intersections

This page was built for publication: On set representation of bounded degree hypergaphs

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