Pages that link to "Item:Q3937418"
From MaRDI portal
The following pages link to On the Size of a Maximum Transversal in a Steiner Triple System (Q3937418):
Displaying 11 items.
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- On the minimum number of blocks of a maximal partial spread in STS(v) and SQS(v) (Q912108) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On partial parallel classes in partial Steiner triple systems (Q2659191) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- Parallelism in Steiner systems (Q5198025) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)