On the maximum size of subfamilies of labeled set with given matching number

DOI10.1007/s10878-019-00451-9zbMath1431.05143OpenAlexW2981911393WikidataQ127009922 ScholiaQ127009922MaRDI QIDQ2279764

Hua Jun Zhang

Publication date: 13 December 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00451-9

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremmatching number

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• A short proof of Erdős' conjecture for triple systems
• On Erdős' extremal problem on matchings in hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH

This page was built for publication: On the maximum size of subfamilies of labeled set with given matching number