16 problems
- 0 votes0 replies1 view
Hilton–Zhao conjecture on overfull graphs with small minimal core degree
Hilton–Zhao conjecture. If , then is overfull.
- 0 votes0 replies0 views
The Overfull Conjecture for graphs of maximum degree greater than one third their order
Overfull Conjecture. Let be a graph of Class with
- 0 votes0 replies2 views
Kahn's asymptotic fractional chromatic-index conjecture
Kahn's conjecture. As the relevant degree parameters tend to infinity, the chromatic index of a -uniform hypergraph is asymptotically equivalent to its fractional chromatic inde…
- 0 votes0 replies0 views
Alon–Kim conjecture on the chromatic index of simple hypergraphs
Alon–Kim conjecture. For every and , there exists such that, for every , every -uniform, -simple hypergraph with maximum degree a…
- 0 votes0 replies0 views
Berge–Füredi conjecture for linear hypergraphs
Berge–Füredi conjecture. A linear (loopless) hypergraph satisfies
- 0 votes0 replies0 views
Generalized Vizing conjecture for linear hypergraphs
Generalized Vizing's conjecture. Every linear hypergraph without loops satisfies
- 0 votes0 replies0 views
Botler, Colucci and Kohayakawa's additive bound conjecture for the mod chromatic index
Let be a simple graph and let be an integer. A -coloring of is an edge coloring such that the subgraph induced by the edges of each color has all degre…
- 0 votes0 replies0 views
Bounded additive gap for the mod chromatic index
Let be a graph, and let denote its mod chromatic index. Bounded additive-gap conjecture. There is a constant such that … for every graph . This conjectu…
- 0 votes0 replies0 views
The Goldberg–Gupta–Seymour chromatic-index density conjecture
Goldberg–Gupta–Seymour conjecture. For any graph , if
- 0 votes0 replies0 views
HZ-graph classification equivalent to the Core Conjecture
Let be an HZ-graph, meaning a connected Class 2 graph with , and let be the Petersen graph with one vertex removed. Let be the…
- 0 votes0 replies0 views
Hilton's Overfull Conjecture for dense graphs
Let be a graph with vertex set , maximum degree , chromatic index , and fractional chromatic index . Hilton's Overfull Conjecture. If … then…
- 0 votes0 replies0 views
Hilton–Zhao Core Conjecture for graphs with sparse core
Let be a connected simple graph. Write for its maximum degree, let be the subgraph induced by the vertices of degree , and let be its chr…
- 0 votes0 replies0 views
The elementary multigraph reformulation of the Goldberg–Seymour conjecture
Elementary-multigraph conjecture. Every multigraph with
- 0 votes0 replies0 views
Andersen–Seymour three-value conjecture for multigraph chromatic index
Andersen–Seymour conjecture.
- 0 votes0 replies0 views
The -adjacent strong chromatic index conjecture
The -adjacent strong chromatic index conjecture. For each positive integer there exist constants and such that
- 0 votes0 replies0 views
Erdős et al.'s chromatic-index conjecture for simple hypergraphs
Let be a simple hypergraph on vertices, meaning that any two hyperedges share at most one vertex. Let denote the chromatic index of , the minimum number of c…