The size of connected hypergraphs with prescribed covering number

DOI10.1016/S0095-8956(81)80020-2MaRDI QIDQ1163035zbMATH OpenFDO

Authors Béla Bollobás, Carsten Thomassen

Publication date 1981

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

Full work available at URL https://doi.org/10.1016/S0095-8956(81)80020-2

zbMATH Keywords

connected hypergraphcovering numberhypertreelower boundr-uniform hypergraph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A Problem in Graph Theory
• Extremal graphs with prescribed covering number
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• On generalized graphs

Cited in

(4)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Almost optimal query algorithm for hitting set using a subset query
• Further studies on chromatic completion of graphs
• Depth of (0,1)-matrices with the same row and same column sums

This page was built for publication: The size of connected hypergraphs with prescribed covering number

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