Oriented trees in O(k \sqrt{k})-chromatic digraphs, a subquadratic bound for Burr's conjecture

MaRDI QIDQ6524060arXivFDO

Authors Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald

Published in arXiv

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6524060)