AlCoVE aims to bring together researchers interested in algebraic combinatorics from around the world. Each talk will be 30 minutes and between talks, there will be casual social activities for spending time with your friends and making new friends.
To access the Zoom links, you must first register for the conference.
To register, click here.
Title: Linear arboricity of sparse multigraphs via orientationsSpeaker: Ronen Wdowinski Affiliation: University of Waterloo Room: MC 5417
The linear arboricity $la(G)$ of a loopless multigraph $G$ is the minimum number of colors required to edge-color $G$ into linear forests, that is, forests whose components are all paths. The Linear Arboricity Conjecture of Akiyama, Exoo, and Harary asserts that the linear arboricity of a simple graph $G$ is at most $\lceil (\Delta(G)+1)/2 \rceil$.