Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

DOI10.1002/jgt.21640zbMath1262.05111OpenAlexW2148998475MaRDI QIDQ4908832

Michael A. Henning, Anders Yeo

Publication date: 7 March 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21640

zbMATH Keywords

independencehypergraphmatchingrank

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On vertex independence number of uniform hypergraphs ⋮ On the transversal number of rank \(k\) hypergraphs ⋮ On the transversal number of \(k\)-uniform connected hypergraphs ⋮ Linear hypergraphs with large transversal number and maximum degree two ⋮ A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size

Uses Software

• nauty

Cites Work

• Independence in graphs with maximum degree four
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Independence, clique size and maximum degree
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
• Tight lower bounds on the size of a maximum matching in a regular graph
• Independent sets in triangle-free cubic planar graphs
• Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
• Hypergraph domination and strong independence
• Size and independence in triangle‐free graphs with maximum degree three
• Decompositions of complete graphs into triangles and Hamilton cycles

This page was built for publication: Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three