Integer and fractional packings in dense graphs
From MaRDI portal
Publication:873647
DOI10.1007/s004930170003zbMath1107.05304OpenAlexW2058108962MaRDI QIDQ873647
Publication date: 29 March 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930170003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Regarding two conjectures on clique and biclique partitions, Clique decompositions of multipartite graphs and completion of Latin squares, Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing, On characterizing hypergraph regularity, Integer and fractional packings in dense 3‐uniform hypergraphs, Multicolor Turán numbers, Minimum \(H\)-decompositions of graphs, Monochromatic Clique Decompositions of Graphs, Additive approximation for edge-deletion problems, Integer and fractional packings of hypergraphs, Packing directed cycles efficiently, Fractional clique decompositions of dense graphs and hypergraphs, Tuza's Conjecture for Threshold Graphs, Fractional cycle decompositions in hypergraphs, Constructive Packings of Triple Systems, Packing and covering directed triangles, Packing and Covering a Given Directed Graph in a Directed Graph, Some Cubic Time Regularity Algorithms for Triple Systems, Tuza's Conjecture is Asymptotically Tight for Dense Graphs, Minimalist designs, Fractional Clique Decompositions of Dense Partite Graphs, Combinatorial and computational aspects of graph packing and graph decomposition, Edge-decompositions of graphs with high minimum degree, Progress towards Nash-Williams' conjecture on triangle decompositions, Packing edge-disjoint triangles in regular and almost regular tournaments, Edge-decompositions of graphs with high minimum degree, Constructive Packings by Linear Hypergraphs, Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, Monochromatic Kr‐Decompositions of Graphs, On the Weisfeiler-Leman dimension of fractional packing, Packing Cliques in Graphs with Independence Number 2, Decomposing Graphs into Edges and Triangles, Packing and covering directed triangles asymptotically, Large triangle packings and Tuza’s conjecture in sparse random graphs, Unnamed Item, Uniform multicommodity flow through the complete graph with random edge-capacities, Many disjoint triangles in co-triangle-free graphs, Sharp bounds for decomposing graphs into edges and triangles, Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions, Triangle packing and covering in dense random graphs, Packing Triangles in Regular Tournaments, Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number, On the decomposition threshold of a given graph, Tuza's conjecture for graphs with maximum average degree less than 7
