Constructive Packings of Triple Systems

DOI10.1137/140965107MaRDI QIDQ4591229zbMATH OpenOpenAlexFDO

Authors B. Nagle

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

zbMATH Keywords

algorithmic integer packingsfractional packingshypergraph regularity

Mathematics Subject Classification ID

Triple systems (05B07) Combinatorial aspects of packing and covering (05B40) Hypergraphs (05C65)

Recommendations

• Embeddings of maximum packings in triple systems
• scientific article; zbMATH DE number 3847402
• Partitions of triples into optimal packings
• On Three-Dimensional Packing
• Three-dimensional packing of perfect tetrahedra
• Anti-Pasch optimal packings with triples
• A 3-(v,4,1) packing construction
• Maximum packings of uniform group divisible triple systems
• Embeddings of maximum packings of triples.

Cites work

• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• An Algorithmic Hypergraph Regularity Lemma
• An Algorithmic Version of the Hypergraph Regularity Method
• An Optimal Algorithm for Checking Regularity
• Constructive packings by linear hypergraphs
• Extremal problems on set systems
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Hypergraph regularity and quasi-randomness
• 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
• Multiplying matrices faster than coppersmith-winograd
• Nearly-perfect hypergraph packing is in NC
• On characterizing hypergraph regularity
• On sets of integers containing k elements in arithmetic progression
• Regularity properties for triple systems
• The Algorithmic Aspects of the Regularity Lemma
• The counting lemma for regular k‐uniform hypergraphs

Cited in

(7)

• Embeddings of maximum packings in triple systems
• scientific article; zbMATH DE number 639731 (Why is no real title available?)
• scientific article; zbMATH DE number 1512680 (Why is no real title available?)
• Triangle packing on tripartite graphs is hard
• Constructive packings by linear hypergraphs
• Approximation algorithms and hardness results for the clique packing problem
• Approximation algorithms and hardness results for the clique packing problem

This page was built for publication: Constructive Packings of Triple Systems

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