Extremal Uniquely Resolvable Multisets

DOI10.1137/22M1481129MaRDI QIDQ5883286zbMATH OpenOpenAlexFDO

Authors

Publication date 30 March 2023

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.10222

zbMATH Keywords

block designextremal set theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Extremal set theory (05D05)

Recommendations

• An upper bound on the sizes of multiset-union-free families
• On existence of sets of distinct representatives for families of subsets of a multiset
• Partition-free families of sets
• An extremal problem for antichains of subsets of a multiset
• An extremal problem for sets with applications to graph theory

Cites work

• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Disjoint spread systems and fault location
• Parametrized complexity theory.

Cited in

(2)

• On a phenomenon of Turán concerning the summands of partitions
• Infinite Families of Partitions into MSTD Subsets

This page was built for publication: Extremal Uniquely Resolvable Multisets

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