PDF-Directed graphs without short cycles Jacob Fox Peter Keevash Benny Sudakov Abstract For a directed graph without loops or parallel edges let denote the size of the smallest feedback arc set i
e the smallest subset such that has no directed cycles Let be the number of unordered pairs of vertices of which are not adjacent We prove that every directed graph
Download Presentation
"Directed graphs without short cycles Jacob Fox Peter Keevash " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.