Near perfect coverings in graphs and hypergraphs
From MaRDI portal
Publication:1092067
DOI10.1016/S0195-6698(85)80045-7zbMath0624.05055OpenAlexW2155295958MaRDI QIDQ1092067
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)80045-7
Hypergraphs (05C65) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items (77)
On the upper bound of the size of the \(r\)-cover-free families ⋮ On Even-Degree Subgraphs of Linear Hypergraphs ⋮ Packing minor-closed families of graphs into complete graphs ⋮ Nearly-perfect hypergraph packing is in NC ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ The number of edge-disjoint transitive triples in a tournament ⋮ On characterizing hypergraph regularity ⋮ Concentration of non‐Lipschitz functions and applications ⋮ Probabilistic methods ⋮ The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique ⋮ The shortest disjunctive normal form of a random Boolean function ⋮ Integer and fractional packings in dense 3‐uniform hypergraphs ⋮ On squashed designs ⋮ The genus of a random graph ⋮ Sequences of Radius k for Complete Bipartite Graphs ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ New bounds for Ryser’s conjecture and related problems ⋮ Every Steiner triple system contains almost spanning \(d\)-ary hypertree ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ Integer and fractional packings of hypergraphs ⋮ Packing directed cycles efficiently ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Induced Decompositions of Highly Dense Graphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Long gaps between primes ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ The Ramsey number R(3, t) has order of magnitude t2/log t ⋮ On Brooks' Theorem for Sparse Graphs ⋮ Tuza's conjecture for random graphs ⋮ Realization of digraphs in Abelian groups and its consequences ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ On the genus of a random graph ⋮ Combining subspace codes ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels ⋮ Subspace packings: constructions and bounds ⋮ The existence of \(k\)-radius sequences ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ The Genus of a Random Bipartite Graph ⋮ The domination number of the graph defined by two levels of the \(n\)-cube. II ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unnamed Item ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ Zero‐sum block designs and graph labelings ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Sequences of radius \(k\) for complete bipartite graphs ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Clumsy packings of graphs ⋮ Note on asymptotically good packings ⋮ Integer and fractional packing of families of graphs ⋮ On the number of partial Steiner systems ⋮ On a hypergraph matching problem ⋮ A note on a conjecture by Füredi ⋮ Path-monochromatic bounded depth rooted trees in (random) tournaments ⋮ Packing Paths in Steiner Triple Systems ⋮ Invitation to intersection problems for finite sets ⋮ Random constructions and density results ⋮ Matchings and covers in hypergraphs ⋮ Near-optimal, distributed edge colouring via the nibble method ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Large triangle packings and Tuza’s conjecture in sparse random graphs ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Uniform multicommodity flow through the complete graph with random edge-capacities ⋮ Pseudorandom hypergraph matchings ⋮ Vertex-disjoint claws in graphs ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ On the domination number of a graph defined by containment ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ Fractional decompositions of dense hypergraphs ⋮ Asymptotic behavior of the chromatic index for hypergraphs ⋮ Probabilistic methods in coloring and decomposition problems ⋮ Decomposing oriented graphs into transitive tournaments
Cites Work
This page was built for publication: Near perfect coverings in graphs and hypergraphs
