On the degree, size, and chromatic index of a uniform hypergraph
From MaRDI portal
Publication:5961544
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
(19)- Uniform hypergraphs under certain intersection constraints between hyperedges
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- Decomposition of bicolored square arrays into bichromatic diagonals
- Coloring 2-intersecting hypergraphs
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Graph and hypergraph colouring via nibble methods: a survey
- On the chromatic index of random uniform hypergraphs
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- A stability theorem for matchings in tripartite 3-graphs
- Boolean tensor decomposition for conjunctive queries with negation
- The intersection spectrum of 3‐chromatic intersecting hypergraphs
- A tale of stars and cliques
- A note on \(G\)-intersecting families
- Decomposition of bi-colored square arrays into balanced diagonals
- Hypergraphs without non-trivial intersecting subgraphs
- On t-Intersecting Hypergraphs with Minimum Positive Codegrees
- Ramsey-nice families of graphs
- Intersections of hypergraphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
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)
