Constructive Packings by Linear Hypergraphs

DOI10.1017/S0963548313000291zbMath1282.05188MaRDI QIDQ5397735

Brendan Nagle, Jill Dizona

Publication date: 24 February 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

fixed linear \(k\)-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Constructive Packings of Triple Systems

Cites Work

• Nearly-perfect hypergraph packing is in NC
• Integer and fractional packings of hypergraphs
• Integer and fractional packings in dense graphs
• Weak hypergraph regularity and linear hypergraphs
• The uniformity lemma for hypergraphs
• Bipartite subgraphs and quasi-randomness
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Weak quasi-randomness for uniform hypergraphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• An Algorithmic Version of the Hypergraph Regularity Method
• The Algorithmic Aspects of the Regularity Lemma
• An Optimal Algorithm for Checking Regularity
• An Algorithmic Regularity Lemma for Hypergraphs
• Extremal problems on set systems
• Integer and fractional packing of families of graphs
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Regularity Lemma for k-uniform hypergraphs