Covers in hypergraphs

DOI10.1007/BF02579237zbMath0509.05056MaRDI QIDQ1838499

Jenő Lehel

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

stability numbercovering numberbipartite matchings

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• On the combinatorial problems which I would most like to see solved
• Triangle-free partial graphs and edge covering theorems
• On some extremal problems in graph theory
• On complete subgraphs of different orders
• Extremal problems in graph theory
• The Representation of a Graph by Set Intersections