Open Problems


TitleAuthor(s)sort iconImp.¹Rec.²Area » Topic » SubtopicPosted by
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.Thomassen✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
Partitionning a tournament into k-strongly connected subtournaments.Thomassen✭✭0Graph Theory » Directed Graphs » Tournamentsfhavet
Inscribed Square ProblemToeplitz✭✭0Topologydlh12
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Graph Theory » Topological G.T. » Crossing numbersRobert Samal
Turán's problem for hypergraphsTuran✭✭0Graph Theory » Hypergraphsfhavet
5-flow conjectureTutte✭✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Triangle-packing vs triangle edge-transversal.Tuza✭✭0Graph Theory » Extremal G.T.fhavet
Dense rational distance sets in the planeUlam✭✭✭0Geometrymdevos
Colouring the square of a planar graphWegner✭✭0Graph Theory » Coloring » Vertex coloringfhavet
Real roots of the flow polynomialWelsh✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Number of Cliques in Minor-Closed ClassesWood✭✭0Graph TheoryDavid Wood
Point sets with no empty pentagonWood1GeometryDavid Wood
Generalised Empty Hexagon ConjectureWood✭✭1GeometryDavid Wood
Woodall's ConjectureWoodall✭✭✭0Graph Theory » Directed Graphsmdevos
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournamentYuster✭✭0Graph Theoryfhavet
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Graph Theory » Extremal G.T.shudeshijie
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Syndicate content