13 problems
- 0 votes0 replies0 views
Barrus–Ferrara–Vandenbussche–Wenger conjecture on rainbow clique saturation
Let be the complete graph on vertices, let be the family of rainbow edge-colorings of , and let denote…
- 0 votes0 replies0 views
Frieze–Krivelevich conjecture on rainbow spanning trees of bounded degree
Frieze–Krivelevich conjecture. There exists a constant such that every globally -bounded coloring contains any spanning tree with bounded maximum degree.
- 0 votes0 replies0 views
Neutrality conjecture for unions of paths in anti-Ramsey numbers
Let be positive integers, let , and let consist of internal edges of the components. A set of edges is neutral for the anti-Ramsey…
- 0 votes0 replies0 views
Rainbow anti-Ramsey conjecture for unions of triangles
Rainbow anti-Ramsey conjecture. The rainbow anti-Ramsey number for vertex-disjoint triangles satisfies
- 0 votes0 replies0 views
Gupta–Pehova–Powierski–Staden conjecture on rainbow--free colorings
Let denote the maximum number of edge colorings of an -vertex graph with colors that contain no rainbow copy of . Let be the Turán graph, t…
- 0 votes0 replies0 views
The proper rainbow triangle-packing conjecture for edge-colored graphs
Let be an edge-colored graph on vertices, let denote its number of edges, and let denote its number of colors. A proper is a collection of vertex-d…
- 0 votes0 replies0 views
The clique counterexample conjecture for balanced edge-colorings
Let be the set of natural numbers such that and, for every , there is some with and a balanced coloring of …
- 0 votes0 replies0 views
The chromatic-discrepancy lower-bound conjecture
Chromatic-discrepancy conjecture. The chromatic discrepancy of is at least .
- 0 votes0 replies0 views
The extremal characterization of complete bidirected graphs without rainbow triangles
Extremal characterization conjecture. If contains no rainbow triangles and
- 0 votes0 replies0 views
Constant-error rainbow tree embedding conjecture
Constant-error rainbow tree conjecture. There is a constant such that every properly coloured has a rainbow copy of every tree on vertices.
- 0 votes0 replies0 views
The equality of replication numbers for cycles and paths
Let and denote, respectively, the path and cycle on vertices, and let denote the replication number of a graph . The cycle–path replication conjectur…
- 0 votes0 replies0 views
The quadratic asymptotic conjecture for replication numbers of paths
Let be the path on vertices, and let denote its replication number. The notation means a quantity bounded in absolute value by a constant multiple of…
- 0 votes0 replies0 views
The odd-order exact formula for replication numbers of paths
Let be the path on vertices, and let denote its replication number. For odd , write the upper-bound formula according to the residue class of m…