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

DOI10.1007/S10878-019-00451-9MaRDI QIDQ2279764zbMATH OpenOpenAlexWikidataFDO

Authors 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

Erdős-Ko-Rado theoremintersecting familymatching number

Mathematics Subject Classification ID

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

Recommendations

• Cross-intersecting families of labeled sets
• Erdős-Ko-Rado theorems of labeled sets
• Intersecting and cross-intersecting families of labeled sets
• On families with bounded matching number
• Families with no s pairwise disjoint sets

Cites work

• A short proof of Erdős' conjecture for triple systems
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Improved bounds for Erdős' matching conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Erdős' extremal problem on matchings in hypergraphs
• On matchings in hypergraphs
• On maximal paths and circuits of graphs
• On the maximum number of edges in a hypergraph with given matching number
• On the maximum number of edges in a triple system not containing a disjoint family of a given size
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• The size of a hypergraph and its matching number

Cited in

(1)

• On families with bounded matching number

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

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