On a packing and covering problem
From MaRDI portal
Publication:1058516
DOI10.1016/S0195-6698(85)80023-8zbMath0565.05016OpenAlexW2088622619WikidataQ105583798 ScholiaQ105583798MaRDI QIDQ1058516
Publication date: 1985
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80023-8
Related Items (only showing first 100 items - show all)
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Concentration of non‐Lipschitz functions and applications ⋮ The shortest disjunctive normal form of a random Boolean function ⋮ Probabilistic combinatorics and the recent work of Peter Keevash ⋮ Turán numbers of sunflowers ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ New bounds for Ryser’s conjecture and related problems ⋮ Asymptotic packing via a branching process ⋮ Long gaps between primes ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ Linear cycles of consecutive lengths ⋮ Avoiding right angles and certain Hamming distances ⋮ Friendly bisections of random graphs ⋮ The Ramsey number R(3, t) has order of magnitude t2/log t ⋮ On Brooks' Theorem for Sparse Graphs ⋮ On asymptotic packing of convex geometric and ordered graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ The number of \(n\)-queens configurations ⋮ Near-optimal distributed edge coloring ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Independence numbers of Johnson-type graphs ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ Many Cliques in Bounded-Degree Hypergraphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Graph and hypergraph packing ⋮ Prominent examples of flip processes ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Bin Packing with Colocations ⋮ Minimalist designs ⋮ Unnamed Item ⋮ On Tight Cycles in Hypergraphs ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Coloured and Directed Designs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unnamed Item ⋮ Turán and Ramsey Properties of Subcube Intersection Graphs ⋮ New constructions for covering designs ⋮ Bootstrap Percolation in High Dimensions ⋮ On the Independence Number of Steiner Systems ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Note on asymptotically good packings ⋮ Integer and fractional packing of families of graphs ⋮ Connected Covering Numbers ⋮ On the number of partial Steiner systems ⋮ Near-optimal list colorings ⋮ Forbidden Intersections ⋮ The effect of induced subgraphs on quasi-randomness ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Extremal problems for triple systems ⋮ A natural barrier in random greedy hypergraph matching ⋮ Bounds on the Maximum Number of Vectors with given Scalar Products ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Generalized covering designs and clique coverings ⋮ Counting Hypergraph Colorings in the Local Lemma Regime ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Pseudorandom hypergraph matchings ⋮ On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Fractional decompositions of dense hypergraphs ⋮ The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ On the upper bound of the size of the \(r\)-cover-free families ⋮ Hypergraph Extensions of the Erdős-Gallai Theorem ⋮ An approximate version of the tree packing conjecture ⋮ All rationals occur as exponents ⋮ Counting Steiner triple systems ⋮ Additive combinatorics and graph theory ⋮ Nearly-perfect hypergraph packing is in NC ⋮ Colouring graphs with sparse neighbourhoods: bounds and applications ⋮ Probabilistic methods ⋮ Near perfect coverings in graphs and hypergraphs ⋮ Distance Ramsey numbers ⋮ On the difference between asymptotically good packings and coverings ⋮ On a combinatorial problem for the set of binary vectors ⋮ Unnamed Item ⋮ What we know and what we do not know about Turán numbers ⋮ On the power of random greedy algorithms ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Large independent sets in regular graphs of large girth ⋮ Minimum \(H\)-decompositions of graphs ⋮ Forbidden submatrices ⋮ On two set-systems with restricted cross-intersections ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ Exact solution of some Turán-type problems ⋮ Representability and boxicity of simplicial complexes
Cites Work
This page was built for publication: On a packing and covering problem
