Asymptotic behavior of the chromatic index for hypergraphs
From MaRDI portal
Publication:805633
Recommendations
Cites work
- Asymptotically good coverings
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3261634 (Why is no real title available?)
- scientific article; zbMATH DE number 3198027 (Why is no real title available?)
- Near perfect coverings in graphs and hypergraphs
- On a packing and covering problem
- On the Size of a Maximum Transversal in a Steiner Triple System
- Two combinatorial covering theorems
Cited in
(only showing first 100 items - show all)- Triangle packings and 1-factors in oriented graphs
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Near-optimal, distributed edge colouring via the nibble method
- Probabilistic methods in coloring and decomposition problems
- Fractional v. integral covers in hypergraphs of bounded edge size
- Nearly perfect matchings in regular simple hypergraphs
- Chromatic index of hypergraphs and Shannon's theorem
- Every H-decomposition of K_n has a nearly resolvable alternative
- On a problem of Erdős and Moser
- The chromatic number of finite group Cayley tables
- On generalized Ramsey theory: The bipartite case
- Strong edge colorings of uniform graphs
- The genus of a random graph
- Asymptotically good list-colorings
- Covering the edges of a random graph by cliques
- Chromatic index of simple hypergraphs
- Resolution of the Oberwolfach problem
- Rainbow matchings for 3-uniform hypergraphs
- Novák's conjecture on cyclic Steiner triple systems and its generalization
- Decomposing hypergraphs into cycle factors
- The \(n\)-queens completion problem
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree
- The Erdős matching conjecture and concentration inequalities
- On a conjecture of Erdős on locally sparse Steiner triple systems
- Decompositions into isomorphic rainbow spanning trees
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Minimum \(H\)-decompositions of graphs
- Covers and partial transversals of Latin squares
- Multicolor Ramsey numbers for triple systems
- On a hypergraph matching problem
- A note on a conjecture by Füredi
- Packing spanning graphs from separable families
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- A better bound on the size of rainbow matchings
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Packing minor-closed families of graphs into complete graphs
- Nearly-perfect hypergraph packing is in NC
- Induced decompositions of highly dense graphs
- Decomposition of bicolored square arrays into bichromatic diagonals
- Decomposition of bi-colored square arrays into balanced diagonals
- An asymptotic upper bound for the chromatic index of random hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Circulants and the chromatic index of Steiner triple systems
- Note on asymptotically good packings
- Minimum \(H\)-decompositions of graphs: edge-critical case
- On the genus of a random graph
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- Near-optimal list colorings
- Concentration of non‐Lipschitz functions and applications
- A Ramsey‐type problem and the Turán numbers*
- Randomly colouring graphs (a combinatorial view)
- Long gaps between primes
- Steiner triple systems with high chromatic index
- Asymptotic packing via a branching process
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On Brooks' Theorem for Sparse Graphs
- Large gaps between consecutive prime numbers containing perfect k-th powers of prime numbers
- Boolean tensor decomposition for conjunctive queries with negation
- Rainbow perfect matchings for 4-uniform hypergraphs
- Rainbow structures in locally bounded colorings of graphs
- Almost all Steiner triple systems are almost resolvable
- The genus of a random bipartite graph
- Packing paths in Steiner triple systems
- A natural barrier in random greedy hypergraph matching
- Triple systems with no three triples spanning at most five points
- On the chromatic index of random uniform hypergraphs
- Steiner triple systems without parallel classes
- The chromatic index of projective triple systems
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Minimum rainbow \(H\)-decompositions of graphs
- Minimum rainbow \(H\)-decompositions of graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- On the degree, size, and chromatic index of a uniform hypergraph
- Rainbow spanning structures in graph and hypergraph systems
- On asymptotic packing of convex geometric and ordered graphs
- Hamilton transversals in random Latin squares
- Graph and hypergraph colouring via nibble methods: a survey
- A proof of the Erdős-Faber-Lovász conjecture
- Near-optimal distributed edge coloring
- Large monochromatic components in colorings of complete hypergraphs
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- Prominent examples of flip processes
- The existence of \(k\)-radius sequences
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- Resolution of the Oberwolfach problem
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Enumeration and asymptotic analysis of edge-disjoint triangle packings in complete graphs
- Tight Hamilton cycles with high discrepancy
- Hanani triple systems
- On the critical finite-size gap scaling for frustration-free Hamiltonians
- On tournament inversion
- New bounds on families without large sunflowers
- Size-Ramsey numbers of graphs with maximum degree three
- Dirac's theorem for linear hypergraphs
- Ascending subgraph decomposition
- Efficient polynomial-time approximation scheme for the genus of dense graphs
- Toward a high-dimensional Dirac's theorem
This page was built for publication: Asymptotic behavior of the chromatic index for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805633)
