Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source notes for Problem 617
almasi_2023_ramsey_turnaround_numbers: Source notes for Problem 617: The Ramsey Turnaround Numbers.
andrasfai_et_al_1974_connection_between_chromatic_number_maximal_clique_minimal_degree_graph: Source notes for Problem 617: On the connection between chromatic number, maximal clique and minimal degree of a graph.
codex_terpstra_2026_fixed_r10_r11_erdos_617: Source notes for Problem 617: Codex–Terpstra: The fixed cases r=10 and r=11 of the Erdős–Gyárfás balanced-colouring conjecture.
erdos_gyarfas_1999_split_balanced_colorings_complete_graphs: Source notes for Problem 617: Split and balanced colorings of complete graphs.
furedi_2015_proof_stability_extremal_graphs_simonovits_stability_from_szemeredis_regularity: Source notes for Problem 617: A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity.
furedi_ramamurthi_2002_splittable_colorings_graphs_hypergraphs: Source notes for Problem 617: On splittable colorings of graphs and hypergraphs.
gyarfas_1998_generalized_split_graphs_ramsey_numbers: Source notes for Problem 617: Generalized Split Graphs and Ramsey Numbers.
gyarfas_2023_problems_close_my_heart: Source notes for Problem 617: Problems close to my heart.
gyarfas_et_al_2002_finite_basis_characterization_split_colorings: Source notes for Problem 617: A finite basis characterization of α-split colorings.
kang_pikhurko_2005_maximum_k_r_1_free_graphs_which_are_not_r_partite: Source notes for Problem 617: Maximum -free graphs which are not -partite.
kara_2026_machine_verified_fixed_r5_erdos_617: Source notes for Problem 617: Kara: Machine verification of the fixed r=5 case of Erdős Problem 617.
kostochka_yancey_2012_ores_conjecture_color_critical_graphs_is_almost_true: Source notes for Problem 617: Ore's Conjecture on color-critical graphs is almost true.
sneiderman_2026_five_color_case_balanced_coloring: Source notes for Problem 617: Sneiderman: The five-color case of an Erdős–Gyárfás balanced-coloring problem.
sneiderman_2026_nine_color_case_balanced_coloring: Source notes for Problem 617: Sneiderman: The nine-color case of an Erdős–Gyárfás balanced-coloring problem.
sneiderman_2026_seven_eight_color_cases_balanced_coloring: Source notes for Problem 617: Sneiderman: The seven- and eight-color cases of an Erdős–Gyárfás balanced-coloring problem.
sneiderman_2026_six_color_case_balanced_coloring: Source notes for Problem 617: Sneiderman: The six-color case of an Erdős–Gyárfás balanced-coloring problem.
These notes summarize sources used in the research. Consult the canonical library records where linked for retained reading copies and bibliographic details.