Showing math.COShow all
2 papers · 1 filter
math.CO2018
Gallai's path decomposition conjecture for triangle-free planar graphs
Fábio Botler, Andrea Jiménez, Maycon Sambinelli
A path decomposition of a graph is a collection of edge-disjoint paths of that covers the edge set of . Gallai (1968) conjectured that every connected graph on verti…
math.CO2017
Maximum number of sum-free colorings in finite abelian groups
Hiep Hàn, Andrea Jiménez
An -coloring of a subset of a finite abelian group is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements with $a…