Home » configure

fhavet

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