On the degree, size, and chromatic index of a uniform hypergraph
From MaRDI portal
Publication:5961544
DOI10.1006/JCTA.1996.2728zbMATH Open0868.05037OpenAlexW2049107701MaRDI QIDQ5961544FDOQ5961544
Publication date: 18 August 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6785d179401e0ae123c92c0b4f8a2167b95b2817
Recommendations
- On the chromatic index of random uniform hypergraphs
- A contribution to the chromatic theory of uniform hypergraphs
- On the degree sequences of uniform hypergraphs
- The chromatic index of simple hypergraphs
- On chromaticity of hypergraphs
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- On the chromatic index of almost all graphs
- Colourings of uniform hypergraphs with large girth and applications
- Asymptotic behavior of the chromatic index for hypergraphs
- scientific article; zbMATH DE number 4122017
Cited In (13)
- A note on \(G\)-intersecting families
- Title not available (Why is that?)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- The intersection spectrum of 3‐chromatic intersecting hypergraphs
- A Stability Theorem for Matchings in Tripartite 3-Graphs
- Ramsey-nice families of graphs
- Uniform hypergraphs under certain intersection constraints between hyperedges
- Decomposition of Bicolored Square Arrays into Bichromatic Diagonals
- Decomposition of bi-colored square arrays into balanced diagonals
- Hypergraphs without non-trivial intersecting subgraphs
- Graph and hypergraph colouring via nibble methods: a survey
- On t-Intersecting Hypergraphs with Minimum Positive Codegrees
- On the Chromatic Index of Random Uniform Hypergraphs
This page was built for publication: On the degree, size, and chromatic index of a uniform hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961544)
