Open Problems


TitleAuthor(s)Imp.¹sort iconRec.²Area » Topic » SubtopicPosted by
Sums of independent random variables with unbounded varianceFeige✭✭0Theoretical Comp. Sci.cwenner
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Graph Theory » Coloring » Vertex coloringAndrew King
Domination in plane triangulationsMatheson; Tarjan✭✭0Graph Theory » Topological G.T.mdevos
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Graph Theory » Basic G.T.andreasruedinger
Are vertex minor closed classes chi-bounded?Geelen✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Distribution and upper bound of mimic numbersBhattacharyya✭✭1Number Theory » Analytic N.T.facility_cttb@i...
Domination in cubic graphsReed✭✭0Graph Theory » Basic G.T.mdevos
A gold-grabbing gameRosenfeld✭✭0Graph Theory » Graph Algorithmsmdevos
Number of Cliques in Minor-Closed ClassesWood✭✭0Graph TheoryDavid Wood
Edge-Colouring Geometric Complete GraphsHurtado✭✭1GeometryDavid Wood
Partition of Complete Geometric Graph into Plane Trees✭✭0GeometryDavid Wood
Realisation problem for the space of knots in the 3-sphereBudney✭✭0Topologyrybu
Fundamental group torsion for subsets of Euclidean 3-spaceAncient/folklore✭✭0Topologyrybu
Friendly partitionsDeVos✭✭0Graph Theory » Basic G.T.mdevos
Separators in string graphsFox; Pach; Tóth✭✭0Graph Theorycibulka
Odd cycles and low oddness✭✭0Graph TheoryGagik
Something like Picard for 1-formsElsner✭✭0AnalysisMathOMan
Perfect 2-error-correcting codes over arbitrary finite alphabets.✭✭0Combinatorics » Codesdavidcullen
Approximation Ratio for Maximum Edge Disjoint Paths problemBentz✭✭0Graph Theoryjcmeyer
Approximation ratio for k-outerplanar graphsBentz✭✭0Graph Theoryjcmeyer
Finding k-edge-outerplanar graph embeddingsBentz✭✭0Graph Theoryjcmeyer
Perfect cuboid✭✭0Number Theory » Computational N.T.tsihonglau
Dividing up the unrestricted partitionsDavid S.; Newman✭✭0CombinatoricsDavidSNewman
Sequence defined on multisetsErickson✭✭1CombinatoricsMartin Erickson
Square achievement game on an n x n gridErickson✭✭1CombinatoricsMartin Erickson
Exact colorings of graphsErickson✭✭0Graph TheoryMartin Erickson
Transversal achievement game on a square gridErickson✭✭1CombinatoricsMartin Erickson
Algorithm for graph homomorphismsFomin; Heggernes; Kratsch✭✭0Graph Theory » Coloring » Homomorphismsjfoniok
The 4x5 chessboard complex is the complement of a link, which link? David Eppstein✭✭0Topologyrybu
Lindelöf hypothesisLindelöf✭✭0Number Theory » Analytic N.T.porton
Star chromatic index of cubic graphsDvorak; Mohar; Samal✭✭0Graph TheoryRobert Samal
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Graph TheoryRobert Samal
Outer reloid of restricted funcoidPorton✭✭0Topologyporton
Sticky Cantor sets✭✭0Topologyporton
Nonseparating planar continuum✭✭0Topologyporton
Hilbert-Smith conjectureDavid Hilbert; Paul A. Smith✭✭0Topologyporton
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Graph Theory » Extremal G.T.shudeshijie
Primitive pythagorean n-tuple tree✭✭0Number Theorytsihonglau
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0Graph Theory » Coloring » LabelingDOT
Covering a square with unit squares✭✭0GeometryMartin Erickson
Extension complexity of (convex) polygons✭✭0Geometry » PolytopesDOT
Matching cut and girth✭✭0Graph Theoryw
Is Skewes' number e^e^e^79 an integer?✭✭0Number Theory » Analytic N.T.VladimirReshetnikov
Funcoidal products inside an inward reloidPorton✭✭0Topologyporton
Forcing a $K_6$-minorBarát ; Joret; Wood✭✭0Graph Theory » Basic G.T. » MinorsDavid Wood
Upgrading a completary multifuncoidPorton✭✭0Topologyporton
Atomicity of the poset of completary multifuncoidsPorton✭✭0Topologyporton
Atomicity of the poset of multifuncoidsPorton✭✭0Topologyporton
Graph product of multifuncoidsPorton✭✭0Topologyporton
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime✭✭0Number Theoryprinceps
Syndicate content