Constructive Packings of Triple Systems
From MaRDI portal
Publication:4591229
DOI10.1137/140965107zbMath1373.05036OpenAlexW2765165929MaRDI QIDQ4591229
Publication date: 13 November 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/803b1bdf1290651b0bf7d51f6d1a2be202719fcd
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly-perfect hypergraph packing is in NC
- Integer and fractional packings of hypergraphs
- Integer and fractional packings in dense graphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- An Algorithmic Version of the Hypergraph Regularity Method
- On sets of integers containing k elements in arithmetic progression
- The Algorithmic Aspects of the Regularity Lemma
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- An Optimal Algorithm for Checking Regularity
- Regularity properties for triple systems
- Extremal problems on set systems
- An Algorithmic Hypergraph Regularity Lemma
- Integer and fractional packing of families of graphs
- On characterizing hypergraph regularity
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Constructive Packings by Linear Hypergraphs
- Multiplying matrices faster than coppersmith-winograd
- The counting lemma for regular k‐uniform hypergraphs
This page was built for publication: Constructive Packings of Triple Systems