Pages that link to "Item:Q1092067"
From MaRDI portal
The following pages link to Near perfect coverings in graphs and hypergraphs (Q1092067):
Displayed 35 items.
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Random constructions and density results (Q1009013) (← links)
- Uniform multicommodity flow through the complete graph with random edge-capacities (Q1038093) (← links)
- Probabilistic methods (Q1091406) (← links)
- On squashed designs (Q1097892) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- The number of edge-disjoint transitive triples in a tournament (Q1886364) (← links)
- The genus of a random graph (Q1896342) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- A note on a conjecture by Füredi (Q2500627) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- Fractional decompositions of dense hypergraphs (Q3429620) (← links)
- On the genus of a random graph (Q4322470) (← links)
- Zero‐sum block designs and graph labelings (Q4373384) (← links)
- (Q4500484) (← links)
- (Q4508624) (← links)
- (Q4511485) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Integer and fractional packing of families of graphs (Q4667859) (← links)
- On characterizing hypergraph regularity (Q4798170) (← links)
- The shortest disjunctive normal form of a random Boolean function (Q4800394) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
- The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> (Q4851927) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)