Asymptotic behavior of the chromatic index for hypergraphs
From MaRDI portal
Publication:805633
DOI10.1016/0097-3165(89)90074-5zbMath0729.05038OpenAlexW2042703645MaRDI QIDQ805633
J. H. Spencer, Nicholas J. Pippenger
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(89)90074-5
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)
Related Items
Packing minor-closed families of graphs into complete graphs, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Nearly-perfect hypergraph packing is in NC, Strong edge colorings of uniform graphs, Packing spanning graphs from separable families, Concentration of non‐Lipschitz functions and applications, A Ramsey‐type problem and the Turán numbers*, The genus of a random graph, Decomposition of bi-colored square arrays into balanced diagonals, Fractional v. integral covers in hypergraphs of bounded edge size, Minimum \(H\)-decompositions of graphs, The \(n\)-queens completion problem, Covering the edges of a random graph by cliques, Every Steiner triple system contains almost spanning \(d\)-ary hypertree, Nearly perfect matchings in regular simple hypergraphs, Integer and fractional packings of hypergraphs, The Erdős matching conjecture and concentration inequalities, Induced Decompositions of Highly Dense Graphs, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, Covers and partial transversals of Latin squares, Asymptotic packing via a branching process, Almost all optimally coloured complete graphs contain a rainbow Hamilton path, Long gaps between primes, Rainbow spanning structures in graph and hypergraph systems, An asymptotic upper bound for the chromatic index of random hypergraphs, The Ramsey number R(3, t) has order of magnitude t2/log t, On Brooks' Theorem for Sparse Graphs, On asymptotic packing of convex geometric and ordered graphs, Hamilton transversals in random Latin squares, Graph and hypergraph colouring via nibble methods: a survey, Steiner Triple Systems with High Chromatic Index, A proof of the Erdős-Faber-Lovász conjecture, A better bound on the size of rainbow matchings, Near-optimal distributed edge coloring, On the genus of a random graph, Decomposition of Bicolored Square Arrays into Bichromatic Diagonals, Large monochromatic components in colorings of complete hypergraphs, Minimum \(H\)-decompositions of graphs: edge-critical case, New bounds on the size of nearly perfect matchings in almost regular hypergraphs, Lower bounds on circuit depth of the quantum approximate optimization algorithm, Prominent examples of flip processes, Multicolor Ramsey numbers for triple systems, The existence of \(k\)-radius sequences, Rainbow structures in locally bounded colorings of graphs, Randomly colouring graphs (a combinatorial view), On a conjecture of Erdős on locally sparse Steiner triple systems, Almost all Steiner triple systems are almost resolvable, Decompositions into isomorphic rainbow spanning trees, The Genus of a Random Bipartite Graph, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The chromatic number of finite group Cayley tables, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Unnamed Item, Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors, Large gaps between consecutive prime numbers containing perfect \(k\)-th powers of prime numbers, Harmonious and achromatic colorings of fragmentable hypergraphs, The Chromatic Index of Projective Triple Systems, Hanani triple systems, New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, Note on asymptotically good packings, Chromatic index of simple hypergraphs, On a hypergraph matching problem, A note on a conjecture by Füredi, Near-optimal list colorings, Unnamed Item, Packing Paths in Steiner Triple Systems, Minimum rainbow \(H\)-decompositions of graphs, Minimum rainbow \(H\)-decompositions of graphs, Edge-coloring of 3-uniform hypergraphs, Resolution of the Oberwolfach problem, Rainbow matchings for 3-uniform hypergraphs, Invitation to intersection problems for finite sets, Novák's conjecture on cyclic Steiner triple systems and its generalization, A natural barrier in random greedy hypergraph matching, Near-optimal, distributed edge colouring via the nibble method, Triangle packings and 1-factors in oriented graphs, Triple systems with no three triples spanning at most five points, Chromatic index of hypergraphs and Shannon's theorem, On the Chromatic Index of Random Uniform Hypergraphs, Steiner Triple Systems without Parallel Classes, Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative, On generalized Ramsey theory: The bipartite case, Decomposing hypergraphs into cycle factors, Probabilistic methods in coloring and decomposition problems
Cites Work
