Home

Open Problem Garden

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

Extremal Graph Theory


TitleAuthor(s)Imp.¹Rec.²Subtopicsort iconPosted by
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0mdevos
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0boris
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1shudeshijie
Complexity of the H-factor problem.Kühn; Osthus✭✭0fhavet
Odd-cycle transversal in triangle-free graphsErdos; Faudree; Pach; Spencer✭✭0fhavet
Triangle-packing vs triangle edge-transversal.Tuza✭✭0fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing✭✭✭0asp
Weak saturation of the cube in the cliqueMorrison; Noel✭1Jon Noel
Multicolour Erdős--Hajnal ConjectureErdos; Hajnal✭✭✭0Jon Noel

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 (295)
    • 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

  • Nowhere-zero flows
  • Shuffle-Exchange Conjecture
  • Algebra
  • Seagull problem
  • Solution to the Lonely Runner Conjecture
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer