Pages that link to "Item:Q1092067"
From MaRDI portal
The following pages link to Near perfect coverings in graphs and hypergraphs (Q1092067):
Displaying 50 items.
- Packing minor-closed families of graphs into complete graphs (Q273186) (← links)
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← links)
- Random graphs and covering graphs of posets (Q580382) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- Random graph coverings. I: General theory and graph connectivity (Q700369) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← 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)
- Asymptotically good coverings (Q1066148) (← links)
- Probabilistic methods (Q1091406) (← links)
- On squashed designs (Q1097892) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- Balanced graphs and noncovering graphs (Q1176731) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- Improved bounds for covering complete uniform hypergraphs (Q1190514) (← 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)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← 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)
- Random covering designs (Q1919670) (← links)
- Growing balanced covering sets (Q1981677) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Covering the edges of a random hypergraph by cliques (Q2158205) (← links)
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree (Q2161203) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- On the domination number of a graph defined by containment (Q2332798) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- A note on a conjecture by Füredi (Q2500627) (← links)
