3 papers
math.CO2025
The Rainbow Arborescence Problem on Cycles
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi +1
The rainbow arborescence conjecture posits that if the arcs of a directed graph with vertices are colored by colors such that each color class forms a spanning arborescen…
math.CO2024
Rainbow Arborescence Conjecture
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi +1
The famous Ryser--Brualdi--Stein conjecture asserts that every Latin square contains a partial transversal of size . Since its appearance, the conjecture has attr…
math.CO2024
Towards the Proximity Conjecture on Group-Labeled Matroids
Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki +2
Consider a matroid whose ground set is equipped with a labeling to an abelian group. A basis of is called -avoiding if the sum of the labels of its elements is not in a…