Local constraints ensuring small representing sets

DOI10.1016/0097-3165(91)90074-QzbMATH Open0728.05059OpenAlexW2028078140MaRDI QIDQ804606FDOQ804606

Authors: Andras Hajnal, Zsolt Tuza, P. Erdős 

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

Recommendations

• scientific article; zbMATH DE number 3478888
• scientific article; zbMATH DE number 3880735
• Minimal covering sets for infinite set systems
• scientific article; zbMATH DE number 4059427
• Small transversals in uniform hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• More on maximal intersecting families of finite sets
• Critical hypergraphs and interesting set-pair systems
• Minimum number of elements of representing a set system of given rank
• Title not available (Why is that?)

Cited In (7)

• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Minimal covering sets for infinite set systems
• Helly property in finite set systems
• Local classification of constraints
• Covering random graphs with monochromatic trees
• Locally small spaces with an application
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs

This page was built for publication: Local constraints ensuring small representing sets

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