fhavet

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