Local constraints ensuring small representing sets

DOI10.1016/0097-3165(91)90074-QzbMath0728.05059OpenAlexW2028078140MaRDI QIDQ804606

Paul Erdős, Zsolt Tuza, Andras Hajnal

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(91)90074-q

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Transversal (matching) theory (05D15) Combinatorial aspects of packing and covering (05B40)

Related Items

K^s-Free Graphs Without Large K^r-Free Subgraphs, Covering random graphs with monochromatic trees, Helly property in finite set systems, Covering graphs by monochromatic trees and Helly-type results for hypergraphs

Cites Work

• Unnamed Item
• Critical hypergraphs and interesting set-pair systems
• More on maximal intersecting families of finite sets
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• Minimum number of elements of representing a set system of given rank