On the matching number of k-uniform connected hypergraphs with maximum degree
From MaRDI portal
Publication:6535802
DOI10.1007/978-3-031-39344-0_6MaRDI QIDQ6535802FDOQ6535802
Authors: Zhongzheng Tang, Haoyang Zou, Zhuo Diao 
Publication date: 28 February 2024
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Paths, Trees, and Flowers
- Faster scaling algorithms for general graph matching problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Matchings in regular graphs from eigenvalues
- Title not available (Why is that?)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- On the transversal number of rank \(k\) hypergraphs
- The size of a hypergraph and its matching number
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Matching and edge-connectivity in regular graphs
- Tight bounds on maximal and maximum matchings
- Tight lower bounds on the size of a maximum matching in a regular graph
- Independent sets and matchings in subcubic graphs
- Regular factors and eigenvalues of regular graphs
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- On the maximum number of edges in a hypergraph with given matching number
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- New lower bounds for matching numbers of general and bipartite graphs
- On Lower Bounds for the Matching Number of Subcubic Graphs
- Tight lower bounds on the matching number in a graph with given maximum degree
- Spectral radius and matchings in graphs
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)
