Covers in hypergraphs

DOI10.1007/BF02579237MaRDI QIDQ1838499zbMATH OpenFDO

Authors Jeno Lehel

Publication date 1982

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

covering numberstability numberbipartite matchings

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• Extremal problems in graph theory
• On complete subgraphs of different orders
• On some extremal problems in graph theory
• On the combinatorial problems which I would most like to see solved
• The Representation of a Graph by Set Intersections
• Triangle-free partial graphs and edge covering theorems

Cited in

(8)

• Minimal covers of infinite hypergraphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs
• Some results and problems on clique coverings of hypergraphs
• Covering the edges of a random hypergraph by cliques
• On the triangle clique cover and \(K_t\) clique cover problems
• An observation concerning Ryser's conjecture
• Hypergraphs without a large star

This page was built for publication: Covers in hypergraphs

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