Integer and fractional packings in dense graphs

DOI10.1007/S004930170003zbMATH Open1107.05304OpenAlexW2058108962MaRDI QIDQ873647FDOQ873647

Authors: Vojtěch Rödl, Penny Haxell 

Publication date: 29 March 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930170003

Recommendations

• Integer and fractional packing of families of graphs
• Integer and fractional packings of hypergraphs
• Integer and fractional packings in dense 3‐uniform hypergraphs
• scientific article; zbMATH DE number 4189776
• Packings in Dense Regular Graphs
• Publication:3032297
• On perfect packings in dense graphs
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• On the packing numbers in graphs
• The complexity of perfect packings in dense graphs

zbMATH Keywords

packingdense graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (50)

• Fractional clique decompositions of dense partite graphs
• Fractional \(K_{4}\)-covers
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Packing triangles in regular tournaments
• Packing and Covering a Given Directed Graph in a Directed Graph
• Combinatorial and computational aspects of graph packing and graph decomposition
• Sharp bounds for decomposing graphs into edges and triangles
• Fractional clique decompositions of dense graphs and hypergraphs
• Multicolor Turán numbers
• Regarding two conjectures on clique and biclique partitions
• Decomposing graphs into edges and triangles
• Integer and fractional packings of hypergraphs
• Edge-decompositions of graphs with high minimum degree
• Edge-decompositions of graphs with high minimum degree
• Many disjoint triangles in co-triangle-free graphs
• Integer and fractional packing of families of graphs
• Triangle packing and covering in dense random graphs
• Packing and covering directed triangles
• On characterizing hypergraph regularity
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• Additive approximation for edge-deletion problems
• Progress towards Nash-Williams' conjecture on triangle decompositions
• Monochromatic \(K_{r}\)-decompositions of graphs
• Packing edge-disjoint triangles in regular and almost regular tournaments
• Title not available (Why is that?)
• Tuza's conjecture is asymptotically tight for dense graphs
• On the decomposition threshold of a given graph
• Clique decompositions of multipartite graphs and completion of Latin squares
• Uniform multicommodity flow through the complete graph with random edge-capacities
• On the Weisfeiler-Leman dimension of fractional packing
• Minimum \(H\)-decompositions of graphs
• Packing directed cycles efficiently
• Minimalist designs
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• Dense graphs with a large triangle cover have a large triangle packing
• Constructive Packings of Triple Systems
• Completing partial packings of bipartite graphs
• Packing and covering directed triangles asymptotically
• Packing Cliques in Graphs with Independence Number 2
• A Turán-type generalization of Tuza's triangle edge cover problem
• Tuza's conjecture for graphs with maximum average degree less than 7
• Fractional cycle decompositions in hypergraphs
• Large triangle packings and Tuza's conjecture in sparse random graphs
• Closing the random graph gap in Tuza's conjecture through the online triangle packing process
• Tuza's Conjecture for Threshold Graphs
• Constructive packings by linear hypergraphs
• Monochromatic clique decompositions of graphs
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
• Some Cubic Time Regularity Algorithms for Triple Systems
• Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles

This page was built for publication: Integer and fractional packings in dense graphs

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