Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Dense rational distance sets in the plane
Ulam
✭✭✭
0
Geometry
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Simplexity of the n-cube
✭✭✭
1
Geometry
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Goldberg's conjecture
Goldberg
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Edge-antipodal colorings of cubes
Norine
✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Termination of the sixth Goodstein Sequence
Graham
✭
0
Logic
mdevos
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
Monochromatic empty triangles
✭✭✭
0
Geometry
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Inequality of the means
✭✭✭
0
Geometry
mdevos
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Friendly partitions
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
Graph Theory
mdevos
Are almost all graphs determined by their spectrum?
✭✭✭
0
Graph Theory
mdevos
Divisibility of central binomial coefficients
Graham
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
A sextic counterexample to Euler's sum of powers conjecture
Euler
✭✭
1
Number Theory
»
Computational N.T.
maxal
Counterexamples to the Baillie-PSW primality test
✭✭
1
Number Theory
»
Computational N.T.
maxal
Diophantine quintuple conjecture
✭✭
1
Number Theory
maxal
Magic square of squares
LaBar
✭✭
1
Number Theory
»
Computational N.T.
maxal
Frobenius number of four or more integers
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
Transversal achievement game on a square grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Covering a square with unit squares
✭✭
0
Geometry
Martin Erickson
Lucas Numbers Modulo m
✭✭
1
Number Theory
Martin Erickson
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
macajova
$C^r$ Stability Conjecture
Palis
;
Smale
✭✭✭✭
0
Analysis
m n
inverse of an integer matrix
Gregory
✭✭
0
Algebra
lvoyster
Length of surreal product
Gonshor
✭
1
Combinatorics
Lukáš Lánský
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Theoretical Comp. Sci.
»
Complexity
KWRegan
Are all Fermat Numbers square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there only finite Fermat Primes?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there infinite number of Mersenne Primes?
✭✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more