Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
»
Graph Theory
Infinite Graphs
Title
Author(s)
Imp.¹
Rec.²
Subtopic
Posted by
End-Devouring Rays
Georgakopoulos
✭
1
Agelos
Seymour's self-minor conjecture
Seymour
✭✭✭
0
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
mdevos
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Robert Samal
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Robert Samal
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Robert Samal
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
mdevos
Strong matchings and covers
Aharoni
✭✭✭
0
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
mdevos
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Algebraic G.T.
(8)
Basic G.T.
(39)
Coloring
(65)
Directed Graphs
(26)
Extremal G.T.
(9)
Graph Algorithms
(3)
Hypergraphs
(5)
Infinite Graphs
(11)
Probabilistic G.T.
(3)
Topological G.T.
(18)
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
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
Partition of Complete Geometric Graph into Plane Trees
Smooth 4-dimensional Poincare conjecture
more
login/create account
Drupal
CSI of Charles University