Pages that link to "Item:Q805633"
From MaRDI portal
The following pages link to Asymptotic behavior of the chromatic index for hypergraphs (Q805633):
Displaying 50 items.
- Packing minor-closed families of graphs into complete graphs (Q273186) (← links)
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- Decomposition of bi-colored square arrays into balanced diagonals (Q322180) (← links)
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Large gaps between consecutive prime numbers containing perfect \(k\)-th powers of prime numbers (Q507426) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- Hanani triple systems (Q690071) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative (Q1587903) (← links)
- The chromatic number of finite group Cayley tables (Q1732031) (← links)
- On generalized Ramsey theory: The bipartite case (Q1850469) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- The genus of a random graph (Q1896342) (← links)
- Covering the edges of a random graph by cliques (Q1906846) (← links)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Novák's conjecture on cyclic Steiner triple systems and its generalization (Q2049450) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree (Q2161203) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Covers and partial transversals of Latin squares (Q2414936) (← links)
- Multicolor Ramsey numbers for triple systems (Q2436825) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- A note on a conjecture by Füredi (Q2500627) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- Decomposition of Bicolored Square Arrays into Bichromatic Diagonals (Q2957062) (← links)
- An asymptotic upper bound for the chromatic index of random hypergraphs (Q3225909) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3410615) (← links)
- Long gaps between primes (Q4588341) (← links)
