Pages that link to "Item:Q1366948"
From MaRDI portal
The following pages link to Nearly perfect matchings in regular simple hypergraphs (Q1366948):
Displaying 28 items.
- Longest partial transversals in plexes (Q404534) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- On 6-sparse Steiner triple systems (Q868878) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Asymptotic estimates on the von Neumann inequality for homogeneous polynomials (Q1789365) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- Covering the edges of a random hypergraph by cliques (Q2158205) (← links)
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree (Q2161203) (← links)
- Packing nearly optimal Ramsey \(R(3,t)\) graphs (Q2182253) (← links)
- On the vertex cover number of 3-uniform hypergraph (Q2240114) (← links)
- Voting rules that are unbiased but not transitive-symmetric (Q2288166) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Random triangle removal (Q2346047) (← links)
- On partial parallel classes in partial Steiner triple systems (Q2659191) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- Minimalist designs (Q5120741) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- Asymptotic Bounds for General Covering Designs (Q5175786) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Colorful Matchings (Q6098465) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- The localization number of designs (Q6188118) (← links)
