On the matching number of k-uniform connected hypergraphs with maximum degree

DOI10.1007/978-3-031-39344-0_6MaRDI QIDQ6535802zbMATH OpenFDO

Authors Zhongzheng Tang, Haoyang Zou, Zhuo Diao

Publication date 28 February 2024

zbMATH Keywords

matching numbermaximum degreeextremal hypergraphs\(k\)-uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On matchings in hypergraphs
• \(d\)-matching in \(k\)-uniform hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• Matching in 3-uniform hypergraphs
• Vertex degree sums for matchings in 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Faster scaling algorithms for general graph matching problems
• Independent sets and matchings in subcubic graphs
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Matching and edge-connectivity in regular graphs
• Matchings in regular graphs from eigenvalues
• New lower bounds for matching numbers of general and bipartite graphs
• On Lower Bounds for the Matching Number of Subcubic Graphs
• On the maximum number of edges in a hypergraph with given matching number
• On the transversal number of rank \(k\) hypergraphs
• Paths, Trees, and Flowers
• Regular factors and eigenvalues of regular graphs
• Spectral radius and matchings in graphs
• The size of a hypergraph and its matching number
• Tight bounds on maximal and maximum matchings
• Tight lower bounds on the matching number in a graph with given maximum degree
• Tight lower bounds on the size of a maximum matching in a regular graph

This page was built for publication: On the matching number of \(k\)-uniform connected hypergraphs with maximum degree

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