Pages that link to "Item:Q873647"
From MaRDI portal
The following pages link to Integer and fractional packings in dense graphs (Q873647):
Displaying 30 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Uniform multicommodity flow through the complete graph with random edge-capacities (Q1038093) (← links)
- Packing and covering directed triangles asymptotically (Q2065998) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Packing and covering directed triangles (Q2191263) (← links)
- Progress towards Nash-Williams' conjecture on triangle decompositions (Q2221932) (← links)
- On the decomposition threshold of a given graph (Q2338634) (← links)
- Tuza's conjecture for graphs with maximum average degree less than 7 (Q2349964) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- Packing Triangles in Regular Tournaments (Q2852611) (← links)
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing (Q3168450) (← links)
- On characterizing hypergraph regularity (Q4798170) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
- Minimalist designs (Q5120741) (← links)
- Monochromatic <i>K<sub>r</sub></i>‐Decompositions of Graphs (Q5418770) (← links)
- Tuza's Conjecture for Threshold Graphs (Q6045403) (← links)
- Fractional cycle decompositions in hypergraphs (Q6052479) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
- Some Cubic Time Regularity Algorithms for Triple Systems (Q6188523) (← links)
