Home » configure

fhavet

TypePostAuthorRepliesLast post
Open problemDo any three longest paths in a connected graph have a vertex in common? fhavet11 year 5 weeks ago
Open problemMonochromatic reachability in arc-colored digraphs fhavet07 years 33 weeks ago
Open problemSteinberg's conjecture fhavet18 years 10 weeks ago
categorydirected path fhavet011 years 21 weeks ago
Open problemErdős-Posa property for long directed cycles fhavet011 years 21 weeks ago
categoryMaia, Ana Karolinna fhavet011 years 21 weeks ago
Open problemLarge acyclic induced subdigraph in a planar oriented graph. fhavet011 years 21 weeks ago
categoryHarutyunyan, Ararat fhavet011 years 21 weeks ago
Open problemCyclic spanning subdigraph with small cyclomatic number fhavet011 years 25 weeks ago
categoryYuster, Raphael fhavet011 years 26 weeks ago
Open problemMinimum number of arc-disjoint transitive subtournaments of order 3 in a tournament fhavet011 years 26 weeks ago
Open problemArc-disjoint directed cycles in regular directed graphs fhavet011 years 27 weeks ago
categoryMolloy, Michael fhavet011 years 27 weeks ago
categoryGiroire, Frédéric fhavet011 years 36 weeks ago
categoryAraújo, Julio fhavet011 years 36 weeks ago
categoryCohen, Nathann fhavet011 years 36 weeks ago
category, Giroire, Frédéric fhavet011 years 36 weeks ago
Open problemDecomposing k-arc-strong tournament into k spanning strong digraphs fhavet011 years 36 weeks ago
categoryfeedback arc set fhavet011 years 36 weeks ago
categoryPTAS fhavet011 years 36 weeks ago
categoryAilon, Nir fhavet011 years 36 weeks ago
Open problemPTAS for feedback arc set in tournaments fhavet011 years 36 weeks ago
categoryAilon, N fhavet011 years 36 weeks ago
categoryTournaments fhavet011 years 36 weeks ago
Open problemPartitionning a tournament into k-strongly connected subtournaments. fhavet011 years 36 weeks ago