Constructive packings by linear hypergraphs

DOI10.1017/S0963548313000291MaRDI QIDQ5397735zbMATH OpenFDO

Authors Jill Dizona, B. Nagle

Publication date 24 February 2014

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

Full work available at URL https://doi.org/10.1017/S0963548313000291

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)

Recommendations

• Constructive Packings of Triple Systems
• Integer and fractional packings of hypergraphs
• Packing k-partite k-uniform hypergraphs
• Packings by cliques and by finite families of graphs
• Integer and fractional packing of families of graphs

Cites work

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

Cited in

(4)

• Optimal line packings from nonabelian groups
• Constructive Packings of Triple Systems
• OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
• Approximation algorithms and hardness results for the clique packing problem

This page was built for publication: Constructive packings by linear hypergraphs

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