Home

Open Problem Garden

  • Help
  • About
  • Contact
  login/create account
Home » Subject » Graph Theory

Infinite Graphs


TitleAuthor(s)sort iconImp.¹Rec.²SubtopicPosted by
Strong matchings and coversAharoni✭✭✭0mdevos
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0mdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0mdevos
Unfriendly partitionsCowan; Emerson✭✭✭0mdevos
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0mdevos
Unions of triangle free graphsErdos; Hajnal✭✭✭0mdevos
Hamiltonian cycles in line graphs of infinite graphsGeorgakopoulos✭✭0Robert Samal
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Robert Samal
End-Devouring RaysGeorgakopoulos✭1Agelos
Infinite uniquely hamiltonian graphsMohar✭✭0Robert Samal
Seymour's self-minor conjectureSeymour✭✭✭0mdevos

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content

Navigate

  • Subject
    • Algebra (7)
    • Analysis (5)
    • Combinatorics (36)
    • Geometry (29)
    • Graph Theory (226)
      • 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 (48)
    • Theoretical Comp. Sci. (13)
    • Topology (40)
    • Unsorted (1)
  • Author index
  • Keyword index
    • more

Recent Activity

  • Several ways to apply a (multivalued) multiargument function to a family of filters
  • Jones' conjecture
  • Multicolour Erdős--Hajnal Conjecture
  • Sidorenko's Conjecture
  • Edge-Unfolding Convex Polyhedra
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer