Infinite Graphs

Home
Search
Subjects

• All (170)
• Ramsey Theory (40)
• Extremal Graph Theory (40)
• Coloring, Packing, and Covering (25)
• Random Graphs and Graph Enumeration (16)
• Hypergraphs (35)
• Infinite Graphs (14)

About Erdös
About This Site

1. Menger's theorem for infinite graphs
2. Ordinal Ramsey: For which \(\alpha\) does \(\omega^{\alpha} → (\omega^{\alpha}, 3)^{2}\)? (Hajnal) ($1000)
3. Ordinal Ramsey: If \(\alpha → (\alpha, 3)^{2},\) then \(\alpha → (\alpha, 4)^{2}\) (Hajnal)
4. Ordinal Ramsey: \(\omega_{1} → (\alpha, 4)^{3}\) for \(\alpha < \omega_{1}\)
5. Ordinal Ramsey: \(\omega_{1}^{2} → (\omega_{1}^{2}, 3)^{2}\)
6. Ordinal Ramsey: \(\omega_{3} → (\omega_{2} + 2)^{3}_{\omega}\)
7. Almost-bipartite graphs with infinite chromatic number (Hajnal, Szemerédi) ($250)
8. Another problem on almost-bipartite graphs with infinite chromatic number
9. Uncountable-chromatic graphs have common \(4\)-chromatic subgraphs (Hajnal)
10. Infinite \(K_{4}\)-free graphs are the union of triangle-free countable graphs (Hajnal) ($250)
11. The harmonic sums of odd-cycle lengths diverges for graphs of infinite chromatic number (Hajnal)
12. There is an uncountable-chromatic graph \(G\) so that the size of the smallest \(n\)-chromatic subgraph grows arbitrarily slowly (Hajnal, Szemerédi)
13. Infinite graphs have infinite paths or arbitrary independent sets (Hajnal, Milner)
14. Down-up matchings in infinite graphs (Larson)