Integer and fractional packings in dense 3‐uniform hypergraphs
- 28 February 2003
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 22 (3) , 248-310
Abstract
Let 𝒥0be any fixed 3‐uniform hypergraph. For a 3‐uniform hypergraph ℋ︁ we define ν(ℋ︁) to be the maximum size of a set of pairwise triple‐disjoint copies of 𝒥0in ℋ︁. We say a function ψ from the set of copies of 𝒥0in ℋ︁ to [0, 1] is afractional𝒥0‐packingof ℋ︁ if ∑Keywords
This publication has 12 references indexed in Scilit:
- Regularity properties for triple systemsRandom Structures & Algorithms, 2003
- The regularity lemma and approximation schemes for dense problems2002
- Extremal problems on set systemsRandom Structures & Algorithms, 2002
- Integer and Fractional Packings in Dense GraphsCombinatorica, 2001
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- Constructive Quasi-Ramsey Numbers and Tournament RankingSIAM Journal on Discrete Mathematics, 1999
- A linear programming perspective on the Frankl?R dl?Pippenger theoremRandom Structures & Algorithms, 1996
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given GraphSIAM Journal on Computing, 1995
- Polynomial time approximation schemes for dense instances of NP-hard problems1995
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985