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

Huajun Zhang ()
Additional contact information
Huajun Zhang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 4, No 17, 1296-1304

Abstract: Abstract A labeled set is a set of distinct elements with labels assigned to the elements. The family $${{\mathcal {L}}}^k_{n,p}$$ L n , p k is the family of labeled k-element subsets of [n] with labels chosen from a set of size p. Two labeled sets are disjoint if they do not share an element that has the same label in both sets. For $$1\le s\le p-1$$ 1 ≤ s ≤ p - 1 , if a family $${\mathcal {F}}\subseteq {\mathcal {L}}^k_{n,p}$$ F ⊆ L n , p k does not have more than s pairwise disjoint members, then $$|{\mathcal {F}}|\le sp^{k-1}\left( {\begin{array}{c}n-1\\ k-1\end{array}}\right) $$ | F | ≤ s p k - 1 n - 1 k - 1 . Furthermore, equality holds if and only if $${\mathcal {F}}$$ F has the form $${{\mathcal {F}}}_{i,S}$$ F i , S , where $${{\mathcal {F}}}_{i,S}$$ F i , S is the family of all members of $${{\mathcal {L}}}^k_{n,p}$$ L n , p k containing the element i and using labels only within the s-set S.

Keywords: Intersecting family; Erdős–Ko–Rado theorem; Matching number; 05D05; 06A07 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00451-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00451-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00451-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().