{"id":"all-union-1981-final-9-football-independent-triple","title":"Три команды без сыгранных матчей, Всесоюзная олимпиада 1981","path":"data\\problems\\all-union\\all-union-1981-final-9-football-independent-triple.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1981-final-9-football-independent-triple.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1981-final-9-football-independent-triple","source_key":"all","source_keys":["all"],"source_label":"Всесоюзная олимпиада","year":"1981","tags":["extremal_graph_theory","matching","degree_counting","pigeonhole_principle","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1981-final-9-football-independent-triple три команды без сыгранных матчей, всесоюзная олимпиада 1981 all всесоюзная олимпиада 1981 extremal_graph_theory matching degree_counting pigeonhole_principle goal_existence с. конягин all-union-1981-final-9-football-independent-triple tri komandy bez sygrannyh matchey, vsesoyuznaya olimpiada 1981 all vsesoyuznaya olimpiada 1981 extremal_graph_theory matching degree_counting pigeonhole_principle goal_existence s. konyagin"}
{"id":"all-union-1985-final-9-complete-graph-edge-coloring","title":"Раскраска пересекающихся сторон и диагоналей правильного n-угольника, Всесоюзная олимпиада 1985","path":"data\\problems\\all-union\\all-union-1985-final-9-complete-graph-edge-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1985-final-9-complete-graph-edge-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1985-final-9-complete-graph-edge-coloring","source_key":"all","source_keys":["all"],"source_label":"Всесоюзная олимпиада","year":"1985","tags":["coloring","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1985-final-9-complete-graph-edge-coloring раскраска пересекающихся сторон и диагоналей правильного n-угольника, всесоюзная олимпиада 1985 all всесоюзная олимпиада 1985 coloring construction goal_exact_bound all-union-1985-final-9-complete-graph-edge-coloring raskraska peresekayuschihsya storon i diagonaley pravilnogo n-ugolnika, vsesoyuznaya olimpiada 1985 all vsesoyuznaya olimpiada 1985 coloring construction goal_exact_bound"}
{"id":"all-union-1986-final-9-tree-distances-n1986-impossible","title":"Невозможность расстояний \\(1,2,\\ldots,\\binom{1986}{2}\\) в дереве, Всесоюзная олимпиада 1986","path":"data\\problems\\all-union\\all-union-1986-final-9-tree-distances-n1986-impossible.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1986-final-9-tree-distances-n1986-impossible.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1986-final-9-tree-distances-n1986-impossible","source_key":"all","source_keys":["all"],"source_label":"\\binom{","year":"1986","tags":["trees","parity_coloring","invariant","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1986-final-9-tree-distances-n1986-impossible невозможность расстояний \\(1,2,\\ldots,\\binom{1986}{2}\\) в дереве, всесоюзная олимпиада 1986 all \\binom{ 1986 trees parity_coloring invariant goal_impossibility all-union-1986-final-9-tree-distances-n1986-impossible nevozmozhnost rasstoyaniy \\(1,2,\\ldots,\\binom{1986}{2}\\) v dereve, vsesoyuznaya olimpiada 1986 all \\binom{ 1986 trees parity_coloring invariant goal_impossibility"}
{"id":"all-union-1986-final-9-tree-distances-n6-construction","title":"Шесть городов с расстояниями 1,2,...,15, Всесоюзная олимпиада 1986","path":"data\\problems\\all-union\\all-union-1986-final-9-tree-distances-n6-construction.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1986-final-9-tree-distances-n6-construction.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1986-final-9-tree-distances-n6-construction","source_key":"all","source_keys":["all"],"source_label":"Всесоюзная олимпиада","year":"1986","tags":["trees","invariant","construction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1986-final-9-tree-distances-n6-construction шесть городов с расстояниями 1,2,...,15, всесоюзная олимпиада 1986 all всесоюзная олимпиада 1986 trees invariant construction goal_existence all-union-1986-final-9-tree-distances-n6-construction shest gorodov s rasstoyaniyami 1,2,...,15, vsesoyuznaya olimpiada 1986 all vsesoyuznaya olimpiada 1986 trees invariant construction goal_existence"}
{"id":"all-union-1986-final-9-tree-distances-one-to-nchoose2","title":"Дерево с попарными расстояниями 1,2,...,n(n-1)/2, Всесоюзная олимпиада 1986","path":"data\\problems\\all-union\\all-union-1986-final-9-tree-distances-one-to-nchoose2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1986-final-9-tree-distances-one-to-nchoose2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1986-final-9-tree-distances-one-to-nchoose2","source_key":"all","source_keys":["all"],"source_label":"Всесоюзная олимпиада","year":"1986","tags":["trees","invariant","parity_coloring","construction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1986-final-9-tree-distances-one-to-nchoose2 дерево с попарными расстояниями 1,2,...,n(n-1)/2, всесоюзная олимпиада 1986 all всесоюзная олимпиада 1986 trees invariant parity_coloring construction goal_characterization all-union-1986-final-9-tree-distances-one-to-nchoose2 derevo s poparnymi rasstoyaniyami 1,2,...,n(n-1)/2, vsesoyuznaya olimpiada 1986 all vsesoyuznaya olimpiada 1986 trees invariant parity_coloring construction goal_characterization"}
{"id":"all-union-1987-final-9-tournament-score-squares","title":"Равенство сумм квадратов побед и поражений в турнире, Всесоюзная олимпиада 1987","path":"data\\problems\\all-union\\all-union-1987-final-9-tournament-score-squares.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/all-union/all-union-1987-final-9-tournament-score-squares.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#all-union-1987-final-9-tournament-score-squares","source_key":"all","source_keys":["all"],"source_label":"Всесоюзная олимпиада","year":"1987","tags":["tournaments","degree_counting","goal_proof"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"all-union-1987-final-9-tournament-score-squares равенство сумм квадратов побед и поражений в турнире, всесоюзная олимпиада 1987 all всесоюзная олимпиада 1987 tournaments degree_counting goal_proof all-union-1987-final-9-tournament-score-squares ravenstvo summ kvadratov pobed i porazheniy v turnire, vsesoyuznaya olimpiada 1987 all vsesoyuznaya olimpiada 1987 tournaments degree_counting goal_proof"}
{"id":"alternating-boundary-pairs-noncrossing-arcs","title":"Непересекающиеся дуги с чередующимися концами на границе диска","path":"data\\problems\\classical\\alternating-boundary-pairs-noncrossing-arcs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/alternating-boundary-pairs-noncrossing-arcs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#alternating-boundary-pairs-noncrossing-arcs","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","connectivity","classical_theorem","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"external_theorem_application","search_text":"alternating-boundary-pairs-noncrossing-arcs непересекающиеся дуги с чередующимися концами на границе диска misc прочее planar_graphs connectivity classical_theorem goal_proof alternating-boundary-pairs-noncrossing-arcs neperesekayuschiesya dugi s chereduyuschimisya kontsami na granitse diska misc prochee planar_graphs connectivity classical_theorem goal_proof"}
{"id":"apmo-2005-p4-firefighters-grid-spread","title":"Пожар на решётке \\(P_n\\square P_n\\), APMO 2005 P4","path":"data\\problems\\apmo\\apmo-2005-p4-firefighters-grid-spread.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/apmo/apmo-2005-p4-firefighters-grid-spread.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#apmo-2005-p4-firefighters-grid-spread","source_key":"apmo","source_keys":["apmo"],"source_label":"APMO","year":"2005","tags":["connectivity","goal_exact_bound"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"apmo-2005-p4-firefighters-grid-spread пожар на решётке \\(p_n\\square p_n\\), apmo 2005 p4 apmo apmo 2005 connectivity goal_exact_bound apmo-2005-p4-firefighters-grid-spread pozhar na reshetke \\(p_n\\square p_n\\), apmo 2005 p4 apmo apmo 2005 connectivity goal_exact_bound"}
{"id":"apmo-2010-p3-common-acquaintance-extremal","title":"Максимум пар вершин на расстоянии 2, APMO 2010 P3","path":"data\\problems\\apmo\\apmo-2010-p3-common-acquaintance-extremal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/apmo/apmo-2010-p3-common-acquaintance-extremal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#apmo-2010-p3-common-acquaintance-extremal","source_key":"apmo","source_keys":["apmo"],"source_label":"APMO","year":"2010","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"apmo-2010-p3-common-acquaintance-extremal максимум пар вершин на расстоянии 2, apmo 2010 p3 apmo apmo 2010 connectivity extremal_graph_theory goal_exact_bound apmo-2010-p3-common-acquaintance-extremal maksimum par vershin na rasstoyanii 2, apmo 2010 p3 apmo apmo 2010 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"apmo-2016-p4-dreamland-28-step-coloring","title":"Раскраска функционального орграфа по 28-шаговой достижимости, APMO 2016 P4","path":"data\\problems\\apmo\\apmo-2016-p4-dreamland-28-step-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/apmo/apmo-2016-p4-dreamland-28-step-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#apmo-2016-p4-dreamland-28-step-coloring","source_key":"apmo","source_keys":["apmo"],"source_label":"APMO","year":"2016","tags":["coloring","graph_model","connectivity","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"apmo-2016-p4-dreamland-28-step-coloring раскраска функционального орграфа по 28-шаговой достижимости, apmo 2016 p4 apmo apmo 2016 coloring graph_model connectivity induction goal_exact_bound warut suksompong apmo-2016-p4-dreamland-28-step-coloring raskraska funktsionalnogo orgrafa po 28-shagovoy dostizhimosti, apmo 2016 p4 apmo apmo 2016 coloring graph_model connectivity induction goal_exact_bound warut suksompong"}
{"id":"augmenting-path-matching-lemma","title":"Критерий максимального паросочетания через увеличивающий путь","path":"data\\problems\\classical\\augmenting-path-matching-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/augmenting-path-matching-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#augmenting-path-matching-lemma","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","augmenting_path","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"augmenting-path-matching-lemma критерий максимального паросочетания через увеличивающий путь misc прочее matching augmenting_path classical_theorem goal_characterization claude berge augmenting-path-matching-lemma kriteriy maksimalnogo parosochetaniya cherez uvelichivayuschiy put misc prochee matching augmenting_path classical_theorem goal_characterization claude berge"}
{"id":"balanced-bipartite-edge-coloring-two-colors","title":"Балансирующая 2-раскраска рёбер двудольного графа","path":"data\\problems\\classical\\balanced-bipartite-edge-coloring-two-colors.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/balanced-bipartite-edge-coloring-two-colors.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#balanced-bipartite-edge-coloring-two-colors","source_key":"misc","source_keys":["misc","imo","fyum"],"source_label":"Прочее","year":"","tags":["eulerian_graphs","coloring","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"balanced-bipartite-edge-coloring-two-colors балансирующая 2-раскраска рёбер двудольного графа misc прочее eulerian_graphs coloring goal_construction balanced-bipartite-edge-coloring-two-colors balansiruyuschaya 2-raskraska reber dvudolnogo grafa misc prochee eulerian_graphs coloring goal_construction"}
{"id":"baltic-way-1992-p14-mother-vertex-reachability","title":"Город, из которого достижимы все остальные, Baltic Way 1992 P14","path":"data\\problems\\baltic-way\\baltic-way-1992-p14-mother-vertex-reachability.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1992-p14-mother-vertex-reachability.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1992-p14-mother-vertex-reachability","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1992","tags":["connectivity","extremal_choice","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1992-p14-mother-vertex-reachability город, из которого достижимы все остальные, baltic way 1992 p14 baltic baltic way 1992 connectivity extremal_choice goal_existence baltic-way-1992-p14-mother-vertex-reachability gorod, iz kotorogo dostizhimy vse ostalnye, baltic way 1992 p14 baltic baltic way 1992 connectivity extremal_choice goal_existence"}
{"id":"baltic-way-1993-p12-three-transport-connected-unions","title":"Три вида транспорта и связность любых двух цветов, Baltic Way 1993 P12","path":"data\\problems\\baltic-way\\baltic-way-1993-p12-three-transport-connected-unions.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1993-p12-three-transport-connected-unions.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1993-p12-three-transport-connected-unions","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1993","tags":["connectivity","double_counting","goal_exact_bound","construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1993-p12-three-transport-connected-unions три вида транспорта и связность любых двух цветов, baltic way 1993 p12 baltic baltic way 1993 connectivity double_counting goal_exact_bound construction baltic-way-1993-p12-three-transport-connected-unions tri vida transporta i svyaznost lyubyh dvuh tsvetov, baltic way 1993 p12 baltic baltic way 1993 connectivity double_counting goal_exact_bound construction"}
{"id":"baltic-way-1994-p19-directed-spy-cycles","title":"Из 10-циклов к 11-циклам в орграфе шпионов, Baltic Way 1994 P19","path":"data\\problems\\baltic-way\\baltic-way-1994-p19-directed-spy-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1994-p19-directed-spy-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1994-p19-directed-spy-cycles","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1994","tags":["hamiltonian_cycles","degree_counting","pigeonhole_principle","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1994-p19-directed-spy-cycles из 10-циклов к 11-циклам в орграфе шпионов, baltic way 1994 p19 baltic baltic way 1994 hamiltonian_cycles degree_counting pigeonhole_principle goal_proof baltic-way-1994-p19-directed-spy-cycles iz 10-tsiklov k 11-tsiklam v orgrafe shpionov, baltic way 1994 p19 baltic baltic way 1994 hamiltonian_cycles degree_counting pigeonhole_principle goal_proof"}
{"id":"baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles","title":"Непересекающиеся гамильтоновы циклы в полном графе, Baltic Way 1997 P19","path":"data\\problems\\baltic-way\\baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1997","tags":["hamiltonian_cycles","double_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles непересекающиеся гамильтоновы циклы в полном графе, baltic way 1997 p19 baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound baltic-way-1997-p19-edge-disjoint-hamiltonian-cycles neperesekayuschiesya gamiltonovy tsikly v polnom grafe, baltic way 1997 p19 baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound"}
{"id":"baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles","title":"Непересекающиеся гамильтоновы циклы при простом числе вершин, Baltic Way 1997 P19(a)","path":"data\\problems\\baltic-way\\baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1997","tags":["hamiltonian_cycles","double_counting","construction","goal_exact_bound","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles непересекающиеся гамильтоновы циклы при простом числе вершин, baltic way 1997 p19(a) baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound graph_model baltic-way-1997-p19a-prime-edge-disjoint-hamiltonian-cycles neperesekayuschiesya gamiltonovy tsikly pri prostom chisle vershin, baltic way 1997 p19(a) baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound graph_model"}
{"id":"baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles","title":"Упаковка гамильтоновых циклов в \\(K_9\\), Baltic Way 1997 P19(b)","path":"data\\problems\\baltic-way\\baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"1997","tags":["hamiltonian_cycles","double_counting","construction","goal_exact_bound","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles упаковка гамильтоновых циклов в \\(k_9\\), baltic way 1997 p19(b) baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound graph_model baltic-way-1997-p19b-k9-edge-disjoint-hamiltonian-cycles upakovka gamiltonovyh tsiklov v \\(k_9\\), baltic way 1997 p19(b) baltic baltic way 1997 hamiltonian_cycles double_counting construction goal_exact_bound graph_model"}
{"id":"baltic-way-2020-p9-cool-graph-labeling","title":"Крутая разметка вершин и рёбер графа, Baltic Way 2020 P9","path":"data\\problems\\baltic-way\\baltic-way-2020-p9-cool-graph-labeling.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-2020-p9-cool-graph-labeling.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-2020-p9-cool-graph-labeling","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"2020","tags":["coloring","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-2020-p9-cool-graph-labeling крутая разметка вершин и рёбер графа, baltic way 2020 p9 baltic baltic way 2020 coloring goal_construction baltic-way-2020-p9-cool-graph-labeling krutaya razmetka vershin i reber grafa, baltic way 2020 p9 baltic baltic way 2020 coloring goal_construction"}
{"id":"baltic-way-2023-p6-colour-touch-graph","title":"Граф соприкосновения цветов в таблице, Baltic Way 2023 P6","path":"data\\problems\\baltic-way\\baltic-way-2023-p6-colour-touch-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-2023-p6-colour-touch-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-2023-p6-colour-touch-graph","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"2023","tags":["connectivity","degree_counting","coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-2023-p6-colour-touch-graph граф соприкосновения цветов в таблице, baltic way 2023 p6 baltic baltic way 2023 connectivity degree_counting coloring goal_exact_bound baltic-way-2023-p6-colour-touch-graph graf soprikosnoveniya tsvetov v tablitse, baltic way 2023 p6 baltic baltic way 2023 connectivity degree_counting coloring goal_exact_bound"}
{"id":"baltic-way-2024-p6-tree-edge-slide-labyrinth","title":"Преобразование дерева ходами по соседним рёбрам, Baltic Way 2024 P6","path":"data\\problems\\baltic-way\\baltic-way-2024-p6-tree-edge-slide-labyrinth.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/baltic-way/baltic-way-2024-p6-tree-edge-slide-labyrinth.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#baltic-way-2024-p6-tree-edge-slide-labyrinth","source_key":"baltic","source_keys":["baltic"],"source_label":"Baltic Way","year":"2024","tags":["trees","connectivity","dynamics","induction","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"baltic-way-2024-p6-tree-edge-slide-labyrinth преобразование дерева ходами по соседним рёбрам, baltic way 2024 p6 baltic baltic way 2024 trees connectivity dynamics induction graph_model goal_existence baltic-way-2024-p6-tree-edge-slide-labyrinth preobrazovanie dereva hodami po sosednim rebram, baltic way 2024 p6 baltic baltic way 2024 trees connectivity dynamics induction graph_model goal_existence"}
{"id":"benjamini-tzalik-shortest-paths","title":"Теорема Беньямини — Цалика о числе кратчайших путей","path":"data\\problems\\classical\\benjamini-tzalik-shortest-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/benjamini-tzalik-shortest-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#benjamini-tzalik-shortest-paths","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","connectivity","degree_counting","classical_theorem","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"benjamini-tzalik-shortest-paths теорема беньямини — цалика о числе кратчайших путей misc прочее extremal_graph_theory connectivity degree_counting classical_theorem goal_bound itai benjamini elad tzalik benjamini-tzalik-shortest-paths teorema benyamini — tsalika o chisle kratchayshih putey misc prochee extremal_graph_theory connectivity degree_counting classical_theorem goal_bound itai benjamini elad tzalik"}
{"id":"bmo-2013-p4-weakly-friendly-cycles-three-rooms","title":"Трёхраскрашиваемость графа недружбы, BMO 2013 P4","path":"data\\problems\\bmo\\bmo-2013-p4-weakly-friendly-cycles-three-rooms.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/bmo/bmo-2013-p4-weakly-friendly-cycles-three-rooms.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bmo-2013-p4-weakly-friendly-cycles-three-rooms","source_key":"bmo","source_keys":["bmo"],"source_label":"BMO","year":"2013","tags":["coloring","extremal_choice","induction","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"bmo-2013-p4-weakly-friendly-cycles-three-rooms трёхраскрашиваемость графа недружбы, bmo 2013 p4 bmo bmo 2013 coloring extremal_choice induction graph_model goal_existence bmo-2013-p4-weakly-friendly-cycles-three-rooms trehraskrashivaemost grafa nedruzhby, bmo 2013 p4 bmo bmo 2013 coloring extremal_choice induction graph_model goal_existence"}
{"id":"bmo-2016-p4-infinite-grid-diamond-coloring","title":"Раскраска бесконечной решётки в метрике \\(L_1\\), BMO 2016 P4","path":"data\\problems\\bmo\\bmo-2016-p4-infinite-grid-diamond-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/bmo/bmo-2016-p4-infinite-grid-diamond-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bmo-2016-p4-infinite-grid-diamond-coloring","source_key":"bmo","source_keys":["bmo"],"source_label":"BMO","year":"2016","tags":["coloring","modular_coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete","search_text":"bmo-2016-p4-infinite-grid-diamond-coloring раскраска бесконечной решётки в метрике \\(l_1\\), bmo 2016 p4 bmo bmo 2016 coloring modular_coloring goal_exact_bound bmo-2016-p4-infinite-grid-diamond-coloring raskraska beskonechnoy reshetki v metrike \\(l_1\\), bmo 2016 p4 bmo bmo 2016 coloring modular_coloring goal_exact_bound"}
{"id":"bmo-2022-p4-frog-grid-boundary-graph","title":"Максимум компонент в двухцветной доске, BMO 2022 P4","path":"data\\problems\\bmo\\bmo-2022-p4-frog-grid-boundary-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/bmo/bmo-2022-p4-frog-grid-boundary-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bmo-2022-p4-frog-grid-boundary-graph","source_key":"bmo","source_keys":["bmo"],"source_label":"BMO","year":"2022","tags":["connectivity","coloring","planar_graphs","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"bmo-2022-p4-frog-grid-boundary-graph максимум компонент в двухцветной доске, bmo 2022 p4 bmo bmo 2022 connectivity coloring planar_graphs goal_exact_bound bmo-2022-p4-frog-grid-boundary-graph maksimum komponent v dvuhtsvetnoy doske, bmo 2022 p4 bmo bmo 2022 connectivity coloring planar_graphs goal_exact_bound"}
{"id":"bmo-2025-p4-flights-long-short-paths","title":"Число рёбер при раздельных кратчайших и длиннейших путях, BMO 2025 P4","path":"data\\problems\\bmo\\bmo-2025-p4-flights-long-short-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/bmo/bmo-2025-p4-flights-long-short-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bmo-2025-p4-flights-long-short-paths","source_key":"bmo","source_keys":["bmo"],"source_label":"BMO","year":"2025","tags":["connectivity","hamiltonian_cycles","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"bmo-2025-p4-flights-long-short-paths число рёбер при раздельных кратчайших и длиннейших путях, bmo 2025 p4 bmo bmo 2025 connectivity hamiltonian_cycles goal_characterization bmo-2025-p4-flights-long-short-paths chislo reber pri razdelnyh kratchayshih i dlinneyshih putyah, bmo 2025 p4 bmo bmo 2025 connectivity hamiltonian_cycles goal_characterization"}
{"id":"bondy-pancyclic-theorem","title":"Теорема Бонди о панцикличности плотных гамильтоновых графов","path":"data\\problems\\classical\\bondy-pancyclic-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/bondy-pancyclic-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bondy-pancyclic-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["hamiltonian_cycles","extremal_graph_theory","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"without_solution","solution_classification_type":"hard_external_theorem_no_proof","search_text":"bondy-pancyclic-theorem теорема бонди о панцикличности плотных гамильтоновых графов misc прочее hamiltonian_cycles extremal_graph_theory classical_theorem goal_exact_bound j. a. bondy bondy-pancyclic-theorem teorema bondi o pantsiklichnosti plotnyh gamiltonovyh grafov misc prochee hamiltonian_cycles extremal_graph_theory classical_theorem goal_exact_bound j. a. bondy"}
{"id":"bounded-forward-rays-balanced-sums","title":"Ограниченные лучи вперёд и сбалансированные суммы","path":"data\\problems\\classical\\bounded-forward-rays-balanced-sums.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/bounded-forward-rays-balanced-sums.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#bounded-forward-rays-balanced-sums","source_key":"misc","source_keys":["misc","imo"],"source_label":"Прочее","year":"","tags":["invariant","extremal_choice","goal_bound","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"bounded-forward-rays-balanced-sums ограниченные лучи вперёд и сбалансированные суммы misc прочее invariant extremal_choice goal_bound goal_existence ivan guo and ross atkins bounded-forward-rays-balanced-sums ogranichennye luchi vpered i sbalansirovannye summy misc prochee invariant extremal_choice goal_bound goal_existence ivan guo and ross atkins"}
{"id":"brooks-theorem","title":"Теорема Брукса о раскраске графа через максимальную степень","path":"data\\problems\\classical\\brooks-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/brooks-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#brooks-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","minimal_counterexample","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"brooks-theorem теорема брукса о раскраске графа через максимальную степень misc прочее coloring minimal_counterexample classical_theorem goal_exact_bound r. l. brooks brooks-theorem teorema bruksa o raskraske grafa cherez maksimalnuyu stepen misc prochee coloring minimal_counterexample classical_theorem goal_exact_bound r. l. brooks"}
{"id":"c4-free-kovari-sos-turan-bound","title":"Оценка Кёвари-Шоша-Турана для графа без четырёхциклов","path":"data\\problems\\classical\\c4-free-kovari-sos-turan-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/c4-free-kovari-sos-turan-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#c4-free-kovari-sos-turan-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","double_counting","classical_theorem","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"c4-free-kovari-sos-turan-bound оценка кёвари-шоша-турана для графа без четырёхциклов misc прочее extremal_graph_theory double_counting classical_theorem goal_bound tamás kővári vera t. sós pál turán c4-free-kovari-sos-turan-bound otsenka kevari-shosha-turana dlya grafa bez chetyrehtsiklov misc prochee extremal_graph_theory double_counting classical_theorem goal_bound tamás kővári vera t. sós pál turán"}
{"id":"caro-wei-independent-set-bound","title":"Лемма Каро-Вея о независимом множестве","path":"data\\problems\\classical\\caro-wei-independent-set-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/caro-wei-independent-set-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#caro-wei-independent-set-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","classical_theorem","goal_bound","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"caro-wei-independent-set-bound лемма каро-вея о независимом множестве misc прочее extremal_graph_theory classical_theorem goal_bound goal_existence yair caro c. c. wei caro-wei-independent-set-bound lemma karo-veya o nezavisimom mnozhestve misc prochee extremal_graph_theory classical_theorem goal_bound goal_existence yair caro c. c. wei"}
{"id":"cayley-prufer-labeled-trees","title":"Формула Кэли для помеченных деревьев через код Прюфера","path":"data\\problems\\classical\\cayley-prufer-labeled-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/cayley-prufer-labeled-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cayley-prufer-labeled-trees","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","classical_theorem","induction","goal_counting","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"cayley-prufer-labeled-trees формула кэли для помеченных деревьев через код прюфера misc прочее trees classical_theorem induction goal_counting goal_construction arthur cayley heinz prüfer cayley-prufer-labeled-trees formula keli dlya pomechennyh derevev cherez kod pryufera misc prochee trees classical_theorem induction goal_counting goal_construction arthur cayley heinz prüfer"}
{"id":"chen-yu-independent-cutset-kolmogorov-merged","title":"Независимый вершинный разрез в графе с не более чем 2n-4 рёбрами","path":"data\\problems\\classical\\chen-yu-independent-cutset-kolmogorov-merged.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/chen-yu-independent-cutset-kolmogorov-merged.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#chen-yu-independent-cutset-kolmogorov-merged","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["connectivity","graph_cut","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"chen-yu-independent-cutset-kolmogorov-merged независимый вершинный разрез в графе с не более чем 2n-4 рёбрами misc прочее connectivity graph_cut extremal_graph_theory goal_exact_bound chen--yu chen-yu-independent-cutset-kolmogorov-merged nezavisimyy vershinnyy razrez v grafe s ne bolee chem 2n-4 rebrami misc prochee connectivity graph_cut extremal_graph_theory goal_exact_bound chen--yu"}
{"id":"cmo-1971-p10-one-way-phone-gossip","title":"Односторонние телефонные звонки и распространение всей информации, CMO 1971 P10","path":"data\\problems\\cmo\\cmo-1971-p10-one-way-phone-gossip.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1971-p10-one-way-phone-gossip.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1971-p10-one-way-phone-gossip","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1971","tags":["connectivity","extremal_choice","goal_construction","goal_algorithm","goal_exact_bound","process_invariant"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"cmo-1971-p10-one-way-phone-gossip односторонние телефонные звонки и распространение всей информации, cmo 1971 p10 cmo cmo 1971 connectivity extremal_choice goal_construction goal_algorithm goal_exact_bound process_invariant canadian mathematical olympiad committee cmo-1971-p10-one-way-phone-gossip odnostoronnie telefonnye zvonki i rasprostranenie vsey informatsii, cmo 1971 p10 cmo cmo 1971 connectivity extremal_choice goal_construction goal_algorithm goal_exact_bound process_invariant canadian mathematical olympiad committee"}
{"id":"cmo-1973-p4-triangulated-nonagon-labelings","title":"Совершенные паросочетания в графе инцидентности треугольников, CMO 1973 P4","path":"data\\problems\\cmo\\cmo-1973-p4-triangulated-nonagon-labelings.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1973-p4-triangulated-nonagon-labelings.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1973-p4-triangulated-nonagon-labelings","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1973","tags":["matching","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"cmo-1973-p4-triangulated-nonagon-labelings совершенные паросочетания в графе инцидентности треугольников, cmo 1973 p4 cmo cmo 1973 matching goal_counting canadian mathematical olympiad committee cmo-1973-p4-triangulated-nonagon-labelings sovershennye parosochetaniya v grafe intsidentnosti treugolnikov, cmo 1973 p4 cmo cmo 1973 matching goal_counting canadian mathematical olympiad committee"}
{"id":"cmo-1976-p8-red-blue-k9-clique","title":"Красная \\(K_4\\) без синего треугольника в \\(K_9\\), CMO 1976 P8","path":"data\\problems\\cmo\\cmo-1976-p8-red-blue-k9-clique.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1976-p8-red-blue-k9-clique.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1976-p8-red-blue-k9-clique","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1976","tags":["ramsey_theory","coloring","forbidden_triangle","forbidden_clique","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"cmo-1976-p8-red-blue-k9-clique красная \\(k_4\\) без синего треугольника в \\(k_9\\), cmo 1976 p8 cmo cmo 1976 ramsey_theory coloring forbidden_triangle forbidden_clique goal_proof cmo-1976-p8-red-blue-k9-clique krasnaya \\(k_4\\) bez sinego treugolnika v \\(k_9\\), cmo 1976 p8 cmo cmo 1976 ramsey_theory coloring forbidden_triangle forbidden_clique goal_proof"}
{"id":"cmo-1977-p7-rectangular-city-self-avoiding-paths","title":"Простые пути в прямоугольной решётке, CMO 1977 P7","path":"data\\problems\\cmo\\cmo-1977-p7-rectangular-city-self-avoiding-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1977-p7-rectangular-city-self-avoiding-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1977-p7-rectangular-city-self-avoiding-paths","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1977","tags":["planar_graphs","connectivity","goal_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"cmo-1977-p7-rectangular-city-self-avoiding-paths простые пути в прямоугольной решётке, cmo 1977 p7 cmo cmo 1977 planar_graphs connectivity goal_counting goal_bound canadian mathematical olympiad committee cmo-1977-p7-rectangular-city-self-avoiding-paths prostye puti v pryamougolnoy reshetke, cmo 1977 p7 cmo cmo 1977 planar_graphs connectivity goal_counting goal_bound canadian mathematical olympiad committee"}
{"id":"cmo-1979-p5-square-lattice-self-avoiding-walks","title":"Самоизбегающие пути в квадратной решётке, CMO 1979 P5","path":"data\\problems\\cmo\\cmo-1979-p5-square-lattice-self-avoiding-walks.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1979-p5-square-lattice-self-avoiding-walks.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1979-p5-square-lattice-self-avoiding-walks","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1979","tags":["connectivity","goal_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"cmo-1979-p5-square-lattice-self-avoiding-walks самоизбегающие пути в квадратной решётке, cmo 1979 p5 cmo cmo 1979 connectivity goal_counting goal_bound cmo-1979-p5-square-lattice-self-avoiding-walks samoizbegayuschie puti v kvadratnoy reshetke, cmo 1979 p5 cmo cmo 1979 connectivity goal_counting goal_bound"}
{"id":"cmo-1989-p4-ladders-ropes-monkeys","title":"Последовательность паросочетаний на пяти линиях, CMO 1989 P4","path":"data\\problems\\cmo\\cmo-1989-p4-ladders-ropes-monkeys.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1989-p4-ladders-ropes-monkeys.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1989-p4-ladders-ropes-monkeys","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1989","tags":["matching","goal_proof","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"cmo-1989-p4-ladders-ropes-monkeys последовательность паросочетаний на пяти линиях, cmo 1989 p4 cmo cmo 1989 matching goal_proof goal_characterization canadian mathematical olympiad committee cmo-1989-p4-ladders-ropes-monkeys posledovatelnost parosochetaniy na pyati liniyah, cmo 1989 p4 cmo cmo 1989 matching goal_proof goal_characterization canadian mathematical olympiad committee"}
{"id":"cmo-1991-p4-edge-difference-labeling-diagram","title":"Разностная разметка десятивершинного графа, CMO 1991 P4","path":"data\\problems\\cmo\\cmo-1991-p4-edge-difference-labeling-diagram.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1991-p4-edge-difference-labeling-diagram.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1991-p4-edge-difference-labeling-diagram","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1991","tags":["coloring","double_counting","eulerian_graphs","goal_impossibility","parity_coloring"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"cmo-1991-p4-edge-difference-labeling-diagram разностная разметка десятивершинного графа, cmo 1991 p4 cmo cmo 1991 coloring double_counting eulerian_graphs goal_impossibility parity_coloring canadian mathematical olympiad committee cmo-1991-p4-edge-difference-labeling-diagram raznostnaya razmetka desyativershinnogo grafa, cmo 1991 p4 cmo cmo 1991 coloring double_counting eulerian_graphs goal_impossibility parity_coloring canadian mathematical olympiad committee"}
{"id":"cmo-1994-p3-voting-stabilizes-cycle","title":"Стабилизация 2-раскраски цикла \\(C_{25}\\), CMO 1994 P3","path":"data\\problems\\cmo\\cmo-1994-p3-voting-stabilizes-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1994-p3-voting-stabilizes-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1994-p3-voting-stabilizes-cycle","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1994","tags":["coloring","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-1994-p3-voting-stabilizes-cycle стабилизация 2-раскраски цикла \\(c_{25}\\), cmo 1994 p3 cmo cmo 1994 coloring induction goal_proof cmo-1994-p3-voting-stabilizes-cycle stabilizatsiya 2-raskraski tsikla \\(c_{25}\\), cmo 1994 p3 cmo cmo 1994 coloring induction goal_proof"}
{"id":"cmo-1995-p3-polygon-quadrangulation-boomerangs","title":"Бумеранги в разбиении выпуклого многоугольника на четырёхугольники, CMO 1995 P3","path":"data\\problems\\cmo\\cmo-1995-p3-polygon-quadrangulation-boomerangs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1995-p3-polygon-quadrangulation-boomerangs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1995-p3-polygon-quadrangulation-boomerangs","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1995","tags":["planar_graphs","double_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-1995-p3-polygon-quadrangulation-boomerangs бумеранги в разбиении выпуклого многоугольника на четырёхугольники, cmo 1995 p3 cmo cmo 1995 planar_graphs double_counting goal_bound canadian mathematical olympiad committee cmo-1995-p3-polygon-quadrangulation-boomerangs bumerangi v razbienii vypuklogo mnogougolnika na chetyrehugolniki, cmo 1995 p3 cmo cmo 1995 planar_graphs double_counting goal_bound canadian mathematical olympiad committee"}
{"id":"cmo-1996-p3-permutation-step-two-mod3","title":"Гамильтоновы пути в квадрате пути, CMO 1996 P3","path":"data\\problems\\cmo\\cmo-1996-p3-permutation-step-two-mod3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-1996-p3-permutation-step-two-mod3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-1996-p3-permutation-step-two-mod3","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"1996","tags":["hamiltonian_cycles","induction","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-1996-p3-permutation-step-two-mod3 гамильтоновы пути в квадрате пути, cmo 1996 p3 cmo cmo 1996 hamiltonian_cycles induction goal_counting canadian mathematical olympiad committee cmo-1996-p3-permutation-step-two-mod3 gamiltonovy puti v kvadrate puti, cmo 1996 p3 cmo cmo 1996 hamiltonian_cycles induction goal_counting canadian mathematical olympiad committee"}
{"id":"cmo-2004-p2-rooks-same-colour","title":"Одноцветные расстановки ладей на доске \\(9\\times9\\), CMO 2004 P2","path":"data\\problems\\cmo\\cmo-2004-p2-rooks-same-colour.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2004-p2-rooks-same-colour.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2004-p2-rooks-same-colour","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2004","tags":["matching","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2004-p2-rooks-same-colour одноцветные расстановки ладей на доске \\(9\\times9\\), cmo 2004 p2 cmo cmo 2004 matching goal_counting canadian mathematical olympiad committee cmo-2004-p2-rooks-same-colour odnotsvetnye rasstanovki ladey na doske \\(9\\times9\\), cmo 2004 p2 cmo cmo 2004 matching goal_counting canadian mathematical olympiad committee"}
{"id":"cmo-2005-p1-triangular-grid-paths","title":"Простые нисходящие пути в треугольной решётке, CMO 2005 P1","path":"data\\problems\\cmo\\cmo-2005-p1-triangular-grid-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2005-p1-triangular-grid-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2005-p1-triangular-grid-paths","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2005","tags":["goal_counting","planar_graphs"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2005-p1-triangular-grid-paths простые нисходящие пути в треугольной решётке, cmo 2005 p1 cmo cmo 2005 goal_counting planar_graphs canadian mathematical olympiad committee cmo-2005-p1-triangular-grid-paths prostye nishodyaschie puti v treugolnoy reshetke, cmo 2005 p1 cmo cmo 2005 goal_counting planar_graphs canadian mathematical olympiad committee"}
{"id":"cmo-2006-p4-cycle-triplets-tournament","title":"Циклические тройки в турнире, CMO 2006 P4","path":"data\\problems\\cmo\\cmo-2006-p4-cycle-triplets-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2006-p4-cycle-triplets-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2006-p4-cycle-triplets-tournament","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2006","tags":["tournaments","extremal_graph_theory","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2006-p4-cycle-triplets-tournament циклические тройки в турнире, cmo 2006 p4 cmo cmo 2006 tournaments extremal_graph_theory double_counting goal_exact_bound cmo-2006-p4-cycle-triplets-tournament tsiklicheskie troyki v turnire, cmo 2006 p4 cmo cmo 2006 tournaments extremal_graph_theory double_counting goal_exact_bound"}
{"id":"cmo-2006-p4-max-cycle-triplets-tournament","title":"Максимум циклических троек в турнире, CMO 2006 P4","path":"data\\problems\\cmo\\cmo-2006-p4-max-cycle-triplets-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2006-p4-max-cycle-triplets-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2006-p4-max-cycle-triplets-tournament","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2006","tags":["tournaments","extremal_graph_theory","double_counting","degree_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2006-p4-max-cycle-triplets-tournament максимум циклических троек в турнире, cmo 2006 p4 cmo cmo 2006 tournaments extremal_graph_theory double_counting degree_counting goal_exact_bound cmo-2006-p4-max-cycle-triplets-tournament maksimum tsiklicheskih troek v turnire, cmo 2006 p4 cmo cmo 2006 tournaments extremal_graph_theory double_counting degree_counting goal_exact_bound"}
{"id":"cmo-2006-p4-min-cycle-triplets-tournament","title":"Минимум циклических троек в турнире, CMO 2006 P4","path":"data\\problems\\cmo\\cmo-2006-p4-min-cycle-triplets-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2006-p4-min-cycle-triplets-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2006-p4-min-cycle-triplets-tournament","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2006","tags":["tournaments","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2006-p4-min-cycle-triplets-tournament минимум циклических троек в турнире, cmo 2006 p4 cmo cmo 2006 tournaments construction goal_exact_bound cmo-2006-p4-min-cycle-triplets-tournament minimum tsiklicheskih troek v turnire, cmo 2006 p4 cmo cmo 2006 tournaments construction goal_exact_bound"}
{"id":"cmo-2008-p5-self-avoiding-rook-walks","title":"Самоизбегающие ладейные пути на доске \\(3\\times n\\), CMO 2008 P5","path":"data\\problems\\cmo\\cmo-2008-p5-self-avoiding-rook-walks.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2008-p5-self-avoiding-rook-walks.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2008-p5-self-avoiding-rook-walks","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2008","tags":["connectivity","goal_counting","goal_classification","induction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2008-p5-self-avoiding-rook-walks самоизбегающие ладейные пути на доске \\(3\\times n\\), cmo 2008 p5 cmo cmo 2008 connectivity goal_counting goal_classification induction canadian mathematical olympiad committee cmo-2008-p5-self-avoiding-rook-walks samoizbegayuschie ladeynye puti na doske \\(3\\times n\\), cmo 2008 p5 cmo cmo 2008 connectivity goal_counting goal_classification induction canadian mathematical olympiad committee"}
{"id":"cmo-2010-p4-graph-neighborhood-toggle","title":"Переключение замкнутых окрестностей в конечном графе, CMO 2010 P4","path":"data\\problems\\cmo\\cmo-2010-p4-graph-neighborhood-toggle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2010-p4-graph-neighborhood-toggle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2010-p4-graph-neighborhood-toggle","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2010","tags":["coloring","induction","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2010-p4-graph-neighborhood-toggle переключение замкнутых окрестностей в конечном графе, cmo 2010 p4 cmo cmo 2010 coloring induction double_counting goal_existence canadian mathematical olympiad committee cmo-2010-p4-graph-neighborhood-toggle pereklyuchenie zamknutyh okrestnostey v konechnom grafe, cmo 2010 p4 cmo cmo 2010 coloring induction double_counting goal_existence canadian mathematical olympiad committee"}
{"id":"cmo-2012-p4-synchronizing-grid-robots","title":"Синхронизирующее слово для решётчатого автомата, CMO 2012 P4","path":"data\\problems\\cmo\\cmo-2012-p4-synchronizing-grid-robots.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2012-p4-synchronizing-grid-robots.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2012-p4-synchronizing-grid-robots","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2012","tags":["connectivity","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2012-p4-synchronizing-grid-robots синхронизирующее слово для решётчатого автомата, cmo 2012 p4 cmo cmo 2012 connectivity induction goal_proof canadian mathematical olympiad committee cmo-2012-p4-synchronizing-grid-robots sinhroniziruyuschee slovo dlya reshetchatogo avtomata, cmo 2012 p4 cmo cmo 2012 connectivity induction goal_proof canadian mathematical olympiad committee"}
{"id":"cmo-2015-p3-grid-hamiltonian-turtle","title":"Гамильтонов цикл в квадратной решётке, CMO 2015 P3","path":"data\\problems\\cmo\\cmo-2015-p3-grid-hamiltonian-turtle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2015-p3-grid-hamiltonian-turtle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2015-p3-grid-hamiltonian-turtle","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2015","tags":["hamiltonian_cycles","double_counting","goal_exact_bound","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2015-p3-grid-hamiltonian-turtle гамильтонов цикл в квадратной решётке, cmo 2015 p3 cmo cmo 2015 hamiltonian_cycles double_counting goal_exact_bound goal_construction canadian mathematical olympiad committee cmo-2015-p3-grid-hamiltonian-turtle gamiltonov tsikl v kvadratnoy reshetke, cmo 2015 p3 cmo cmo 2015 hamiltonian_cycles double_counting goal_exact_bound goal_construction canadian mathematical olympiad committee"}
{"id":"cmo-2018-p3-divisor-prime-related-cycle","title":"Гамильтонов цикл в графе делителей, CMO 2018 P3","path":"data\\problems\\cmo\\cmo-2018-p3-divisor-prime-related-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2018-p3-divisor-prime-related-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2018-p3-divisor-prime-related-cycle","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2018","tags":["hamiltonian_cycles","induction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2018-p3-divisor-prime-related-cycle гамильтонов цикл в графе делителей, cmo 2018 p3 cmo cmo 2018 hamiltonian_cycles induction goal_characterization canadian mathematical olympiad committee cmo-2018-p3-divisor-prime-related-cycle gamiltonov tsikl v grafe deliteley, cmo 2018 p3 cmo cmo 2018 hamiltonian_cycles induction goal_characterization canadian mathematical olympiad committee"}
{"id":"cmo-2019-p5-odd-cycle-edge-game","title":"Игра в добавление рёбер до первого нечётного цикла и её варианты","path":"data\\problems\\cmo\\cmo-2019-p5-odd-cycle-edge-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2019-p5-odd-cycle-edge-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2019-p5-odd-cycle-edge-game","source_key":"cmo","source_keys":["cmo","lktg"],"source_label":"CMO","year":"2019","tags":["goal_strategy_game","coloring","matching","extremal_graph_theory","symmetrization","graph_symmetry","invariant","goal_classification"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2019-p5-odd-cycle-edge-game игра в добавление рёбер до первого нечётного цикла и её варианты cmo cmo 2019 goal_strategy_game coloring matching extremal_graph_theory symmetrization graph_symmetry invariant goal_classification cmo-2019-p5-odd-cycle-edge-game igra v dobavlenie reber do pervogo nechetnogo tsikla i ee varianty cmo cmo 2019 goal_strategy_game coloring matching extremal_graph_theory symmetrization graph_symmetry invariant goal_classification"}
{"id":"cmo-2020-p5-friendship-induced-subgraphs","title":"Минимум рёбер при плотных половинных подграфах, CMO 2020 P5","path":"data\\problems\\cmo\\cmo-2020-p5-friendship-induced-subgraphs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2020-p5-friendship-induced-subgraphs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2020-p5-friendship-induced-subgraphs","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2020","tags":["extremal_graph_theory","extremal_choice","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2020-p5-friendship-induced-subgraphs минимум рёбер при плотных половинных подграфах, cmo 2020 p5 cmo cmo 2020 extremal_graph_theory extremal_choice double_counting goal_exact_bound канадское математическое общество cmo-2020-p5-friendship-induced-subgraphs minimum reber pri plotnyh polovinnyh podgrafah, cmo 2020 p5 cmo cmo 2020 extremal_graph_theory extremal_choice double_counting goal_exact_bound kanadskoe matematicheskoe obschestvo"}
{"id":"cmo-2022-p4-region-adjacency-coloring","title":"Раскраска графа смежности областей, CMO 2022 P4","path":"data\\problems\\cmo\\cmo-2022-p4-region-adjacency-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2022-p4-region-adjacency-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2022-p4-region-adjacency-coloring","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2022","tags":["planar_graphs","coloring","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2022-p4-region-adjacency-coloring раскраска графа смежности областей, cmo 2022 p4 cmo cmo 2022 planar_graphs coloring goal_characterization canadian mathematical olympiad committee cmo-2022-p4-region-adjacency-coloring raskraska grafa smezhnosti oblastey, cmo 2022 p4 cmo cmo 2022 planar_graphs coloring goal_characterization canadian mathematical olympiad committee"}
{"id":"cmo-2023-p2-three-regular-bootstrap-friendship","title":"Активация в 3-регулярном графе, CMO 2023 P2","path":"data\\problems\\cmo\\cmo-2023-p2-three-regular-bootstrap-friendship.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2023-p2-three-regular-bootstrap-friendship.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2023-p2-three-regular-bootstrap-friendship","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2023","tags":["double_counting","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2023-p2-three-regular-bootstrap-friendship активация в 3-регулярном графе, cmo 2023 p2 cmo cmo 2023 double_counting goal_impossibility канадское математическое общество cmo-2023-p2-three-regular-bootstrap-friendship aktivatsiya v 3-regulyarnom grafe, cmo 2023 p2 cmo cmo 2023 double_counting goal_impossibility kanadskoe matematicheskoe obschestvo"}
{"id":"cmo-2023-p5-cut-bound-independent-set","title":"Независимое множество при ограниченных разрезах, CMO 2023 P5","path":"data\\problems\\cmo\\cmo-2023-p5-cut-bound-independent-set.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2023-p5-cut-bound-independent-set.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2023-p5-cut-bound-independent-set","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2023","tags":["extremal_graph_theory","graph_cut","extremal_choice","double_counting","coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2023-p5-cut-bound-independent-set независимое множество при ограниченных разрезах, cmo 2023 p5 cmo cmo 2023 extremal_graph_theory graph_cut extremal_choice double_counting coloring goal_exact_bound cmo-2023-p5-cut-bound-independent-set nezavisimoe mnozhestvo pri ogranichennyh razrezah, cmo 2023 p5 cmo cmo 2023 extremal_graph_theory graph_cut extremal_choice double_counting coloring goal_exact_bound"}
{"id":"cmo-2025-p1-voting-functional-graph","title":"Обновление стрелок в функциональном орграфе, CMO 2025 P1","path":"data\\problems\\cmo\\cmo-2025-p1-voting-functional-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2025-p1-voting-functional-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2025-p1-voting-functional-graph","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2025","tags":["connectivity","goal_proof"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"cmo-2025-p1-voting-functional-graph обновление стрелок в функциональном орграфе, cmo 2025 p1 cmo cmo 2025 connectivity goal_proof cmo-2025-p1-voting-functional-graph obnovlenie strelok v funktsionalnom orgrafe, cmo 2025 p1 cmo cmo 2025 connectivity goal_proof"}
{"id":"cmo-2025-p5-ant-planar-graph","title":"Маршруты в помеченном графе разбиения прямоугольника, CMO 2025 P5","path":"data\\problems\\cmo\\cmo-2025-p5-ant-planar-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2025-p5-ant-planar-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2025-p5-ant-planar-graph","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2025","tags":["planar_graphs","connectivity","degree_counting","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"cmo-2025-p5-ant-planar-graph маршруты в помеченном графе разбиения прямоугольника, cmo 2025 p5 cmo cmo 2025 planar_graphs connectivity degree_counting goal_impossibility canadian mathematical olympiad committee cmo-2025-p5-ant-planar-graph marshruty v pomechennom grafe razbieniya pryamougolnika, cmo 2025 p5 cmo cmo 2025 planar_graphs connectivity degree_counting goal_impossibility canadian mathematical olympiad committee"}
{"id":"cmo-2026-p3-grid-hamiltonian-snail","title":"Игра на гамильтоновом пути решётки, CMO 2026 P3","path":"data\\problems\\cmo\\cmo-2026-p3-grid-hamiltonian-snail.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/cmo/cmo-2026-p3-grid-hamiltonian-snail.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cmo-2026-p3-grid-hamiltonian-snail","source_key":"cmo","source_keys":["cmo"],"source_label":"CMO","year":"2026","tags":["hamiltonian_cycles","coloring","parity_coloring","double_counting","goal_exact_bound","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cmo-2026-p3-grid-hamiltonian-snail игра на гамильтоновом пути решётки, cmo 2026 p3 cmo cmo 2026 hamiltonian_cycles coloring parity_coloring double_counting goal_exact_bound goal_strategy_game canadian mathematical olympiad committee cmo-2026-p3-grid-hamiltonian-snail igra na gamiltonovom puti reshetki, cmo 2026 p3 cmo cmo 2026 hamiltonian_cycles coloring parity_coloring double_counting goal_exact_bound goal_strategy_game canadian mathematical olympiad committee"}
{"id":"color-reduction-by-odd-deletion-and-doubling","title":"Понижение числа цветов удалением нечётных вершин и удвоением","path":"data\\problems\\classical\\color-reduction-by-odd-deletion-and-doubling.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/color-reduction-by-odd-deletion-and-doubling.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#color-reduction-by-odd-deletion-and-doubling","source_key":"misc","source_keys":["misc","imo"],"source_label":"Прочее","year":"","tags":["coloring","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"color-reduction-by-odd-deletion-and-doubling понижение числа цветов удалением нечётных вершин и удвоением misc прочее coloring induction goal_exact_bound color-reduction-by-odd-deletion-and-doubling ponizhenie chisla tsvetov udaleniem nechetnyh vershin i udvoeniem misc prochee coloring induction goal_exact_bound"}
{"id":"colored-spanning-tree-good-family-exchange-lemma","title":"Целевой цветовой профиль в хорошем семействе цветных остовов","path":"data\\problems\\classical\\colored-spanning-tree-good-family-exchange-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/colored-spanning-tree-good-family-exchange-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#colored-spanning-tree-good-family-exchange-lemma","source_key":"misc","source_keys":["misc","rmm"],"source_label":"Прочее","year":"","tags":["trees","coloring","extremal_choice","goal_existence","classical_lemma"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution_lemma_extracted","search_text":"colored-spanning-tree-good-family-exchange-lemma целевой цветовой профиль в хорошем семействе цветных остовов misc прочее trees coloring extremal_choice goal_existence classical_lemma colored-spanning-tree-good-family-exchange-lemma tselevoy tsvetovoy profil v horoshem semeystve tsvetnyh ostovov misc prochee trees coloring extremal_choice goal_existence classical_lemma"}
{"id":"complete-graph-minus-n-minus-2-edges-hamiltonian-path","title":"Гамильтонов путь после удаления не более n-2 рёбер из полного графа","path":"data\\problems\\classical\\complete-graph-minus-n-minus-2-edges-hamiltonian-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/complete-graph-minus-n-minus-2-edges-hamiltonian-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#complete-graph-minus-n-minus-2-edges-hamiltonian-path","source_key":"misc","source_keys":["misc","inmo"],"source_label":"Прочее","year":"","tags":["hamiltonian_cycles","connectivity","extremal_graph_theory","degree_counting","classical_lemma"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"complete-graph-minus-n-minus-2-edges-hamiltonian-path гамильтонов путь после удаления не более n-2 рёбер из полного графа misc прочее hamiltonian_cycles connectivity extremal_graph_theory degree_counting classical_lemma complete-graph-minus-n-minus-2-edges-hamiltonian-path gamiltonov put posle udaleniya ne bolee n-2 reber iz polnogo grafa misc prochee hamiltonian_cycles connectivity extremal_graph_theory degree_counting classical_lemma"}
{"id":"complete-graph-triangle-edge-weights-minimum-parametric","title":"Веса 1, 2, 3 на рёбрах полных графов, УТЮМ 2019","path":"data\\problems\\utyum\\complete-graph-triangle-edge-weights-minimum-parametric.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/complete-graph-triangle-edge-weights-minimum-parametric.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#complete-graph-triangle-edge-weights-minimum-parametric","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2019","tags":["extremal_graph_theory","matching","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"complete-graph-triangle-edge-weights-minimum-parametric веса 1, 2, 3 на рёбрах полных графов, утюм 2019 misc утюм 2019 extremal_graph_theory matching goal_exact_bound complete-graph-triangle-edge-weights-minimum-parametric vesa 1, 2, 3 na rebrah polnyh grafov, utyum 2019 misc utyum 2019 extremal_graph_theory matching goal_exact_bound"}
{"id":"consecutive-pair-barrier-step-two-permutation","title":"Барьер из соседней пары в перестановке с шагом не больше двух","path":"data\\problems\\classical\\consecutive-pair-barrier-step-two-permutation.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/consecutive-pair-barrier-step-two-permutation.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#consecutive-pair-barrier-step-two-permutation","source_key":"misc","source_keys":["misc","cmo"],"source_label":"Прочее","year":"","tags":["goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"consecutive-pair-barrier-step-two-permutation барьер из соседней пары в перестановке с шагом не больше двух misc прочее goal_proof canadian mathematical olympiad committee consecutive-pair-barrier-step-two-permutation barer iz sosedney pary v perestanovke s shagom ne bolshe dvuh misc prochee goal_proof canadian mathematical olympiad committee"}
{"id":"cops-and-robber-dismantlable-characterization","title":"Один полицейский и разбойник: критерий разбираемого графа","path":"data\\problems\\classical\\cops-and-robber-dismantlable-characterization.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/cops-and-robber-dismantlable-characterization.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cops-and-robber-dismantlable-characterization","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["connectivity","induction","goal_strategy_game","goal_characterization","classical_theorem"],"agent_topics":["game_strategy"],"solution_state":"without_solution","solution_classification_type":"hard_external_theorem_no_proof","search_text":"cops-and-robber-dismantlable-characterization один полицейский и разбойник: критерий разбираемого графа misc прочее connectivity induction goal_strategy_game goal_characterization classical_theorem richard nowakowski peter winkler cops-and-robber-dismantlable-characterization odin politseyskiy i razboynik: kriteriy razbiraemogo grafa misc prochee connectivity induction goal_strategy_game goal_characterization classical_theorem richard nowakowski peter winkler"}
{"id":"cubic-graph-four-cycle-bound","title":"В 3-регулярном графе не более 3n/2 циклов длины 4","path":"data\\problems\\classical\\cubic-graph-four-cycle-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/cubic-graph-four-cycle-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cubic-graph-four-cycle-bound","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"cubic-graph-four-cycle-bound в 3-регулярном графе не более 3n/2 циклов длины 4 misc прочее extremal_graph_theory double_counting goal_exact_bound cubic-graph-four-cycle-bound v 3-regulyarnom grafe ne bolee 3n/2 tsiklov dliny 4 misc prochee extremal_graph_theory double_counting goal_exact_bound"}
{"id":"cubic-polyhedron-large-face-fork-strategy-lemma","title":"Большая грань и вилка в игре на гранях кубического многогранника","path":"data\\problems\\classical\\cubic-polyhedron-large-face-fork-strategy-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/cubic-polyhedron-large-face-fork-strategy-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#cubic-polyhedron-large-face-fork-strategy-lemma","source_key":"misc","source_keys":["misc","putnam"],"source_label":"Прочее","year":"","tags":["planar_graphs","degree_counting","double_counting","goal_strategy_game","classical_lemma"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"cubic-polyhedron-large-face-fork-strategy-lemma большая грань и вилка в игре на гранях кубического многогранника misc прочее planar_graphs degree_counting double_counting goal_strategy_game classical_lemma cubic-polyhedron-large-face-fork-strategy-lemma bolshaya gran i vilka v igre na granyah kubicheskogo mnogogrannika misc prochee planar_graphs degree_counting double_counting goal_strategy_game classical_lemma"}
{"id":"degeneracy-greedy-coloring","title":"Вырожденность графа и жадная раскраска","path":"data\\problems\\classical\\degeneracy-greedy-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/degeneracy-greedy-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#degeneracy-greedy-coloring","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","classical_theorem","goal_bound","goal_algorithm","induction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"degeneracy-greedy-coloring вырожденность графа и жадная раскраска misc прочее coloring classical_theorem goal_bound goal_algorithm induction degeneracy-greedy-coloring vyrozhdennost grafa i zhadnaya raskraska misc prochee coloring classical_theorem goal_bound goal_algorithm induction"}
{"id":"dense-graph-long-theta-subgraph","title":"Плотный граф содержит theta-подграф с двумя длинными ветвями","path":"data\\problems\\classical\\dense-graph-long-theta-subgraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/dense-graph-long-theta-subgraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#dense-graph-long-theta-subgraph","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"dense-graph-long-theta-subgraph плотный граф содержит theta-подграф с двумя длинными ветвями misc прочее extremal_graph_theory goal_existence j. a. bondy and m. simonovits dense-graph-long-theta-subgraph plotnyy graf soderzhit theta-podgraf s dvumya dlinnymi vetvyami misc prochee extremal_graph_theory goal_existence j. a. bondy and m. simonovits"}
{"id":"digraph-outdegree-greedy-coloring-bound","title":"Жадная оценка раскраски орграфа с ограниченной исходящей степенью","path":"data\\problems\\classical\\digraph-outdegree-greedy-coloring-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/digraph-outdegree-greedy-coloring-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#digraph-outdegree-greedy-coloring-bound","source_key":"misc","source_keys":["misc","apmo"],"source_label":"Прочее","year":"","tags":["coloring","induction","goal_bound","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"digraph-outdegree-greedy-coloring-bound жадная оценка раскраски орграфа с ограниченной исходящей степенью misc прочее coloring induction goal_bound classical_theorem digraph-outdegree-greedy-coloring-bound zhadnaya otsenka raskraski orgrafa s ogranichennoy ishodyaschey stepenyu misc prochee coloring induction goal_bound classical_theorem"}
{"id":"dirac-theorem","title":"Теорема Дирака о гамильтоновом цикле","path":"data\\problems\\classical\\dirac-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/dirac-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#dirac-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["hamiltonian_cycles","extremal_choice","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"dirac-theorem теорема дирака о гамильтоновом цикле misc прочее hamiltonian_cycles extremal_choice classical_theorem goal_exact_bound gabriel andrew dirac dirac-theorem teorema diraka o gamiltonovom tsikle misc prochee hamiltonian_cycles extremal_choice classical_theorem goal_exact_bound gabriel andrew dirac"}
{"id":"disk-triangulation-boundary-degree-chain-reduction","title":"Граничные степени и удаляемая цепь в триангуляции диска","path":"data\\problems\\classical\\disk-triangulation-boundary-degree-chain-reduction.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/disk-triangulation-boundary-degree-chain-reduction.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#disk-triangulation-boundary-degree-chain-reduction","source_key":"misc","source_keys":["misc","putnam"],"source_label":"Прочее","year":"","tags":["planar_graphs","double_counting","degree_counting","induction","goal_existence","classical_lemma"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"disk-triangulation-boundary-degree-chain-reduction граничные степени и удаляемая цепь в триангуляции диска misc прочее planar_graphs double_counting degree_counting induction goal_existence classical_lemma disk-triangulation-boundary-degree-chain-reduction granichnye stepeni i udalyaemaya tsep v triangulyatsii diska misc prochee planar_graphs double_counting degree_counting induction goal_existence classical_lemma"}
{"id":"dolnikov-deletion-independent-set-lemma","title":"Лемма Дольникова о независимом множестве после удаления вершины","path":"data\\problems\\classical\\dolnikov-deletion-independent-set-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/dolnikov-deletion-independent-set-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#dolnikov-deletion-independent-set-lemma","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","matching","forbidden_clique","classical_theorem","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"dolnikov-deletion-independent-set-lemma лемма дольникова о независимом множестве после удаления вершины misc прочее extremal_graph_theory matching forbidden_clique classical_theorem goal_existence дольников в.л. dolnikov-deletion-independent-set-lemma lemma dolnikova o nezavisimom mnozhestve posle udaleniya vershiny misc prochee extremal_graph_theory matching forbidden_clique classical_theorem goal_existence dolnikov v.l."}
{"id":"edge-count-bipartite-matching-bound","title":"Много рёбер в двудольном графе дают большое паросочетание","path":"data\\problems\\classical\\edge-count-bipartite-matching-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/edge-count-bipartite-matching-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#edge-count-bipartite-matching-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","classical_lemma","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_tool","search_text":"edge-count-bipartite-matching-bound много рёбер в двудольном графе дают большое паросочетание misc прочее matching classical_lemma goal_exact_bound dénes kőnig edge-count-bipartite-matching-bound mnogo reber v dvudolnom grafe dayut bolshoe parosochetanie misc prochee matching classical_lemma goal_exact_bound dénes kőnig"}
{"id":"edge-critical-bridgeless-graphs-give-critical-strong-orientations","title":"Критическая сильная ориентация из мостов после удаления каждого ребра","path":"data\\problems\\classical\\edge-critical-bridgeless-graphs-give-critical-strong-orientations.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/edge-critical-bridgeless-graphs-give-critical-strong-orientations.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#edge-critical-bridgeless-graphs-give-critical-strong-orientations","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["connectivity","classical_lemma","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_complete","search_text":"edge-critical-bridgeless-graphs-give-critical-strong-orientations критическая сильная ориентация из мостов после удаления каждого ребра misc прочее connectivity classical_lemma goal_construction edge-critical-bridgeless-graphs-give-critical-strong-orientations kriticheskaya silnaya orientatsiya iz mostov posle udaleniya kazhdogo rebra misc prochee connectivity classical_lemma goal_construction"}
{"id":"egmo-2016-p3-blue-cells-bipartite-incidence","title":"Синие клетки и двудольный граф строк и столбцов, EGMO 2016 P3","path":"data\\problems\\egmo\\egmo-2016-p3-blue-cells-bipartite-incidence.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/egmo/egmo-2016-p3-blue-cells-bipartite-incidence.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#egmo-2016-p3-blue-cells-bipartite-incidence","source_key":"egmo","source_keys":["egmo"],"source_label":"EGMO","year":"2016","tags":["connectivity","double_counting","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"egmo-2016-p3-blue-cells-bipartite-incidence синие клетки и двудольный граф строк и столбцов, egmo 2016 p3 egmo egmo 2016 connectivity double_counting extremal_graph_theory goal_exact_bound egmo-2016-p3-blue-cells-bipartite-incidence sinie kletki i dvudolnyy graf strok i stolbtsov, egmo 2016 p3 egmo egmo 2016 connectivity double_counting extremal_graph_theory goal_exact_bound"}
{"id":"egmo-2022-p5-domino-parity-bipartite-matching","title":"Чётность домино-разбиений и двудольные паросочетания, EGMO 2022 P5","path":"data\\problems\\egmo\\egmo-2022-p5-domino-parity-bipartite-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/egmo/egmo-2022-p5-domino-parity-bipartite-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#egmo-2022-p5-domino-parity-bipartite-matching","source_key":"egmo","source_keys":["egmo"],"source_label":"EGMO","year":"2022","tags":["matching","graph_symmetry","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"egmo-2022-p5-domino-parity-bipartite-matching чётность домино-разбиений и двудольные паросочетания, egmo 2022 p5 egmo egmo 2022 matching graph_symmetry goal_characterization egmo-2022-p5-domino-parity-bipartite-matching chetnost domino-razbieniy i dvudolnye parosochetaniya, egmo 2022 p5 egmo egmo 2022 matching graph_symmetry goal_characterization"}
{"id":"egmo-2025-p5-rotating-arrows-even-dynamic-cycle","title":"Вращающиеся стрелки на чётной доске, EGMO 2025 P5","path":"data\\problems\\egmo\\egmo-2025-p5-rotating-arrows-even-dynamic-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/egmo/egmo-2025-p5-rotating-arrows-even-dynamic-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#egmo-2025-p5-rotating-arrows-even-dynamic-cycle","source_key":"egmo","source_keys":["egmo"],"source_label":"EGMO","year":"2025","tags":["graph_symmetry","hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"egmo-2025-p5-rotating-arrows-even-dynamic-cycle вращающиеся стрелки на чётной доске, egmo 2025 p5 egmo egmo 2025 graph_symmetry hamiltonian_cycles goal_exact_bound egmo-2025-p5-rotating-arrows-even-dynamic-cycle vraschayuschiesya strelki na chetnoy doske, egmo 2025 p5 egmo egmo 2025 graph_symmetry hamiltonian_cycles goal_exact_bound"}
{"id":"egmo-2025-p5-rotating-arrows-odd-parity","title":"Вращающиеся стрелки на нечётной доске, EGMO 2025 P5","path":"data\\problems\\egmo\\egmo-2025-p5-rotating-arrows-odd-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/egmo/egmo-2025-p5-rotating-arrows-odd-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#egmo-2025-p5-rotating-arrows-odd-parity","source_key":"egmo","source_keys":["egmo"],"source_label":"EGMO","year":"2025","tags":["graph_symmetry","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"egmo-2025-p5-rotating-arrows-odd-parity вращающиеся стрелки на нечётной доске, egmo 2025 p5 egmo egmo 2025 graph_symmetry goal_impossibility egmo-2025-p5-rotating-arrows-odd-parity vraschayuschiesya strelki na nechetnoy doske, egmo 2025 p5 egmo egmo 2025 graph_symmetry goal_impossibility"}
{"id":"erdos-gallai-path-edge-bound","title":"Теорема Эрдёша-Галлая о числе рёбер без длинного пути","path":"data\\problems\\classical\\erdos-gallai-path-edge-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/erdos-gallai-path-edge-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#erdos-gallai-path-edge-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","classical_theorem","goal_bound","induction","extremal_choice"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"erdos-gallai-path-edge-bound теорема эрдёша-галлая о числе рёбер без длинного пути misc прочее extremal_graph_theory classical_theorem goal_bound induction extremal_choice paul erdős tibor gallai erdos-gallai-path-edge-bound teorema erdesha-gallaya o chisle reber bez dlinnogo puti misc prochee extremal_graph_theory classical_theorem goal_bound induction extremal_choice paul erdős tibor gallai"}
{"id":"euler-formula-planar","title":"Формула Эйлера для планарных графов","path":"data\\problems\\classical\\euler-formula-planar.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/euler-formula-planar.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#euler-formula-planar","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","classical_theorem","induction","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"euler-formula-planar формула эйлера для планарных графов misc прочее planar_graphs classical_theorem induction goal_counting leonhard euler euler-formula-planar formula eylera dlya planarnyh grafov misc prochee planar_graphs classical_theorem induction goal_counting leonhard euler"}
{"id":"euler-trail-extension-center-forest","title":"Продление эйлерова пути из центральной вершины","path":"data\\problems\\classical\\euler-trail-extension-center-forest.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/euler-trail-extension-center-forest.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#euler-trail-extension-center-forest","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["eulerian_graphs","trees","goal_characterization","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"euler-trail-extension-center-forest продление эйлерова пути из центральной вершины misc прочее eulerian_graphs trees goal_characterization classical_theorem euler-trail-extension-center-forest prodlenie eylerova puti iz tsentralnoy vershiny misc prochee eulerian_graphs trees goal_characterization classical_theorem"}
{"id":"eulerian-graph-criterion","title":"Критерий эйлерова цикла по чётности степеней","path":"data\\problems\\classical\\eulerian-graph-criterion.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/eulerian-graph-criterion.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#eulerian-graph-criterion","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["eulerian_graphs","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"eulerian-graph-criterion критерий эйлерова цикла по чётности степеней misc прочее eulerian_graphs classical_theorem goal_characterization leonhard euler eulerian-graph-criterion kriteriy eylerova tsikla po chetnosti stepeney misc prochee eulerian_graphs classical_theorem goal_characterization leonhard euler"}
{"id":"ferry-network-repartition-lemma","title":"Переразбиение полной двудольной сети после закрытия поперечного ребра","path":"data\\problems\\classical\\ferry-network-repartition-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ferry-network-repartition-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ferry-network-repartition-lemma","source_key":"misc","source_keys":["misc","imo"],"source_label":"Прочее","year":"","tags":["connectivity","extremal_choice","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ferry-network-repartition-lemma переразбиение полной двудольной сети после закрытия поперечного ребра misc прочее connectivity extremal_choice goal_proof ferry-network-repartition-lemma pererazbienie polnoy dvudolnoy seti posle zakrytiya poperechnogo rebra misc prochee connectivity extremal_choice goal_proof"}
{"id":"five-color-theorem","title":"Пятицветная теорема о раскраске планарных графов","path":"data\\problems\\classical\\five-color-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/five-color-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#five-color-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","coloring","degree_counting","double_counting","classical_theorem","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"five-color-theorem пятицветная теорема о раскраске планарных графов misc прочее planar_graphs coloring degree_counting double_counting classical_theorem induction goal_exact_bound percy john heawood five-color-theorem pyatitsvetnaya teorema o raskraske planarnyh grafov misc prochee planar_graphs coloring degree_counting double_counting classical_theorem induction goal_exact_bound percy john heawood"}
{"id":"flashlight-batteries-tournament-cities-2015","title":"Минимум рёбер без больших независимых множеств, Турнир городов 2015/16","path":"data\\problems\\classical\\flashlight-batteries-tournament-cities-2015.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/flashlight-batteries-tournament-cities-2015.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#flashlight-batteries-tournament-cities-2015","source_key":"flashlight","source_keys":["flashlight"],"source_label":"Турнир городов","year":"2015","tags":["extremal_graph_theory","complement_graph_transition","pigeonhole_principle","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"flashlight-batteries-tournament-cities-2015 минимум рёбер без больших независимых множеств, турнир городов 2015/16 flashlight турнир городов 2015 extremal_graph_theory complement_graph_transition pigeonhole_principle goal_exact_bound кноп к.а. flashlight-batteries-tournament-cities-2015 minimum reber bez bolshih nezavisimyh mnozhestv, turnir gorodov 2015/16 flashlight turnir gorodov 2015 extremal_graph_theory complement_graph_transition pigeonhole_principle goal_exact_bound knop k.a."}
{"id":"functional-digraph-pointer-jumping-round-halving","title":"Сжатие цикла и путей за один раунд прыжков по указателям","path":"data\\problems\\classical\\functional-digraph-pointer-jumping-round-halving.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/functional-digraph-pointer-jumping-round-halving.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#functional-digraph-pointer-jumping-round-halving","source_key":"misc","source_keys":["misc","cmo"],"source_label":"Прочее","year":"","tags":["invariant","extremal_choice","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"functional-digraph-pointer-jumping-round-halving сжатие цикла и путей за один раунд прыжков по указателям misc прочее invariant extremal_choice goal_bound functional-digraph-pointer-jumping-round-halving szhatie tsikla i putey za odin raund pryzhkov po ukazatelyam misc prochee invariant extremal_choice goal_bound"}
{"id":"fyum-2008-final-p8","title":"Три n-клики без клики размера n+1 и 3-раскраска, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-final-p8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-final-p8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-final-p8","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["coloring","matching","complement_graph_transition","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-final-p8 три n-клики без клики размера n+1 и 3-раскраска, фюм 2008 fyum фюм 2008 coloring matching complement_graph_transition goal_exact_bound fyum-2008-final-p8 tri n-kliki bez kliki razmera n+1 i 3-raskraska, fyum 2008 fyum fyum 2008 coloring matching complement_graph_transition goal_exact_bound"}
{"id":"fyum-2008-tur2a-p5","title":"Выбор чисел в вершинах двудольного графа с различием на рёбрах, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur2a-p5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur2a-p5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur2a-p5","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-tur2a-p5 выбор чисел в вершинах двудольного графа с различием на рёбрах, фюм 2008 fyum фюм 2008 goal_proof fyum-2008-tur2a-p5 vybor chisel v vershinah dvudolnogo grafa s razlichiem na rebrah, fyum 2008 fyum fyum 2008 goal_proof"}
{"id":"fyum-2008-tur2b-p5","title":"Невозможная 200-раскраска рёбер при заданных степенях, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur2b-p5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur2b-p5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur2b-p5","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-tur2b-p5 невозможная 200-раскраска рёбер при заданных степенях, фюм 2008 fyum фюм 2008 coloring goal_exact_bound fyum-2008-tur2b-p5 nevozmozhnaya 200-raskraska reber pri zadannyh stepenyah, fyum 2008 fyum fyum 2008 coloring goal_exact_bound"}
{"id":"fyum-2008-tur3a-p2","title":"15 вершин с рёбрами при разности номеров не меньше 10, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur3a-p2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur3a-p2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur3a-p2","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["ramsey_theory","trees","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-tur3a-p2 15 вершин с рёбрами при разности номеров не меньше 10, фюм 2008 fyum фюм 2008 ramsey_theory trees goal_construction fyum-2008-tur3a-p2 15 vershin s rebrami pri raznosti nomerov ne menshe 10, fyum 2008 fyum fyum 2008 ramsey_theory trees goal_construction"}
{"id":"fyum-2008-tur3b-p7","title":"Ориентация 10-регулярного графа с короткими ориентированными путями, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur3b-p7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur3b-p7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur3b-p7","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-tur3b-p7 ориентация 10-регулярного графа с короткими ориентированными путями, фюм 2008 fyum фюм 2008 coloring goal_exact_bound fyum-2008-tur3b-p7 orientatsiya 10-regulyarnogo grafa s korotkimi orientirovannymi putyami, fyum 2008 fyum fyum 2008 coloring goal_exact_bound"}
{"id":"fyum-2008-tur4a-p7","title":"Гамильтонов цикл по условию на пары степеней, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur4a-p7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur4a-p7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur4a-p7","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["hamiltonian_cycles","goal_existence"],"agent_topics":[],"solution_state":"without_solution","solution_classification_type":"hard_external_theorem_no_proof","search_text":"fyum-2008-tur4a-p7 гамильтонов цикл по условию на пары степеней, фюм 2008 fyum фюм 2008 hamiltonian_cycles goal_existence fyum-2008-tur4a-p7 gamiltonov tsikl po usloviyu na pary stepeney, fyum 2008 fyum fyum 2008 hamiltonian_cycles goal_existence"}
{"id":"fyum-2008-tur4b-p10","title":"Гамильтонов цикл после замыкания плотного графа, ФЮМ 2008","path":"data\\problems\\fyum\\fyum-2008-tur4b-p10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2008-tur4b-p10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2008-tur4b-p10","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2008","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2008-tur4b-p10 гамильтонов цикл после замыкания плотного графа, фюм 2008 fyum фюм 2008 extremal_graph_theory goal_exact_bound fyum-2008-tur4b-p10 gamiltonov tsikl posle zamykaniya plotnogo grafa, fyum 2008 fyum fyum 2008 extremal_graph_theory goal_exact_bound"}
{"id":"fyum-2009-final-p2","title":"Рамсеевская альтернатива для 100 красных рёбер или синего цикла, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-final-p2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-final-p2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-final-p2","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["ramsey_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-final-p2 рамсеевская альтернатива для 100 красных рёбер или синего цикла, фюм 2009 fyum фюм 2009 ramsey_theory goal_exact_bound fyum-2009-final-p2 ramseevskaya alternativa dlya 100 krasnyh reber ili sinego tsikla, fyum 2009 fyum fyum 2009 ramsey_theory goal_exact_bound"}
{"id":"fyum-2009-tur2a-p4","title":"Важные циклы в графе, разбитом на n-клики, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-tur2a-p4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-tur2a-p4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-tur2a-p4","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-tur2a-p4 важные циклы в графе, разбитом на n-клики, фюм 2009 fyum фюм 2009 coloring goal_exact_bound fyum-2009-tur2a-p4 vazhnye tsikly v grafe, razbitom na n-kliki, fyum 2009 fyum fyum 2009 coloring goal_exact_bound"}
{"id":"fyum-2009-tur3a-p7","title":"Периодическая раскраска связного графа и хроматическое число, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-tur3a-p7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-tur3a-p7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-tur3a-p7","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-tur3a-p7 периодическая раскраска связного графа и хроматическое число, фюм 2009 fyum фюм 2009 coloring goal_exact_bound fyum-2009-tur3a-p7 periodicheskaya raskraska svyaznogo grafa i hromaticheskoe chislo, fyum 2009 fyum fyum 2009 coloring goal_exact_bound"}
{"id":"fyum-2009-tur3b-p7","title":"Ориентация дерева от корня и суммы на рёбрах, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-tur3b-p7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-tur3b-p7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-tur3b-p7","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-tur3b-p7 ориентация дерева от корня и суммы на рёбрах, фюм 2009 fyum фюм 2009 trees goal_proof fyum-2009-tur3b-p7 orientatsiya dereva ot kornya i summy na rebrah, fyum 2009 fyum fyum 2009 trees goal_proof"}
{"id":"fyum-2009-tur4a-p2","title":"Ациклическая переориентация с сохранением достижимости, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-tur4a-p2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-tur4a-p2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-tur4a-p2","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-tur4a-p2 ациклическая переориентация с сохранением достижимости, фюм 2009 fyum фюм 2009 goal_exact_bound fyum-2009-tur4a-p2 atsiklicheskaya pereorientatsiya s sohraneniem dostizhimosti, fyum 2009 fyum fyum 2009 goal_exact_bound"}
{"id":"fyum-2009-tur4b-p2","title":"Одноцветный длинный путь в двухцветном ациклическом турнире, ФЮМ 2009","path":"data\\problems\\fyum\\fyum-2009-tur4b-p2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2009-tur4b-p2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2009-tur4b-p2","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2009","tags":["coloring","tournaments","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2009-tur4b-p2 одноцветный длинный путь в двухцветном ациклическом турнире, фюм 2009 fyum фюм 2009 coloring tournaments goal_existence fyum-2009-tur4b-p2 odnotsvetnyy dlinnyy put v dvuhtsvetnom atsiklicheskom turnire, fyum 2009 fyum fyum 2009 coloring tournaments goal_existence"}
{"id":"fyum-2010-tur1a-p8","title":"Сбалансированная k-раскраска рёбер двудольного графа, ФЮМ 2010","path":"data\\problems\\fyum\\fyum-2010-tur1a-p8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2010-tur1a-p8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2010-tur1a-p8","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2010","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2010-tur1a-p8 сбалансированная k-раскраска рёбер двудольного графа, фюм 2010 fyum фюм 2010 coloring goal_counting fyum-2010-tur1a-p8 sbalansirovannaya k-raskraska reber dvudolnogo grafa, fyum 2010 fyum fyum 2010 coloring goal_counting"}
{"id":"fyum-2010-tur2a-p1","title":"Граф с чётным числом доминирующих множеств, ФЮМ 2010","path":"data\\problems\\fyum\\fyum-2010-tur2a-p1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2010-tur2a-p1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2010-tur2a-p1","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2010","tags":["goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2010-tur2a-p1 граф с чётным числом доминирующих множеств, фюм 2010 fyum фюм 2010 goal_counting fyum-2010-tur2a-p1 graf s chetnym chislom dominiruyuschih mnozhestv, fyum 2010 fyum fyum 2010 goal_counting"}
{"id":"fyum-2010-tur3a-p7","title":"5-раскраска 100-регулярного графа без двухцветных циклов, ФЮМ 2010","path":"data\\problems\\fyum\\fyum-2010-tur3a-p7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2010-tur3a-p7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2010-tur3a-p7","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2010","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2010-tur3a-p7 5-раскраска 100-регулярного графа без двухцветных циклов, фюм 2010 fyum фюм 2010 coloring goal_exact_bound fyum-2010-tur3a-p7 5-raskraska 100-regulyarnogo grafa bez dvuhtsvetnyh tsiklov, fyum 2010 fyum fyum 2010 coloring goal_exact_bound"}
{"id":"fyum-2010-tur3b-p3","title":"6-регулярный граф с 3-раскраской всех циклов, ФЮМ 2010","path":"data\\problems\\fyum\\fyum-2010-tur3b-p3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2010-tur3b-p3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2010-tur3b-p3","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2010","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2010-tur3b-p3 6-регулярный граф с 3-раскраской всех циклов, фюм 2010 fyum фюм 2010 coloring goal_counting fyum-2010-tur3b-p3 6-regulyarnyy graf s 3-raskraskoy vseh tsiklov, fyum 2010 fyum fyum 2010 coloring goal_counting"}
{"id":"fyum-2011-finalb-p4","title":"Гамильтонов путь в турнире с первыми рёбрами одного направления, ФЮМ 2011","path":"data\\problems\\fyum\\fyum-2011-finalb-p4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2011-finalb-p4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2011-finalb-p4","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2011","tags":["tournaments","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2011-finalb-p4 гамильтонов путь в турнире с первыми рёбрами одного направления, фюм 2011 fyum фюм 2011 tournaments goal_counting fyum-2011-finalb-p4 gamiltonov put v turnire s pervymi rebrami odnogo napravleniya, fyum 2011 fyum fyum 2011 tournaments goal_counting"}
{"id":"fyum-2011-tur1a-p5","title":"Двухцветная раскраска рёбер 2-рёберно-связного графа диаметра 2, ФЮМ 2011","path":"data\\problems\\fyum\\fyum-2011-tur1a-p5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2011-tur1a-p5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2011-tur1a-p5","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2011","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2011-tur1a-p5 двухцветная раскраска рёбер 2-рёберно-связного графа диаметра 2, фюм 2011 fyum фюм 2011 coloring goal_counting fyum-2011-tur1a-p5 dvuhtsvetnaya raskraska reber 2-reberno-svyaznogo grafa diametra 2, fyum 2011 fyum fyum 2011 coloring goal_counting"}
{"id":"fyum-2011-tur2a-p9","title":"Чётное число гамильтоновых циклов через ребро в графе нечётных степеней, ФЮМ 2011","path":"data\\problems\\fyum\\fyum-2011-tur2a-p9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2011-tur2a-p9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2011-tur2a-p9","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2011","tags":["hamiltonian_cycles","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2011-tur2a-p9 чётное число гамильтоновых циклов через ребро в графе нечётных степеней, фюм 2011 fyum фюм 2011 hamiltonian_cycles goal_counting fyum-2011-tur2a-p9 chetnoe chislo gamiltonovyh tsiklov cherez rebro v grafe nechetnyh stepeney, fyum 2011 fyum fyum 2011 hamiltonian_cycles goal_counting"}
{"id":"fyum-2013-tur1a-p4","title":"Цикл с суммой меток рёбер, делящейся на n, в полном графе, ФЮМ 2013","path":"data\\problems\\fyum\\fyum-2013-tur1a-p4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2013-tur1a-p4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2013-tur1a-p4","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2013","tags":["induction","extremal_choice","invariant","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2013-tur1a-p4 цикл с суммой меток рёбер, делящейся на n, в полном графе, фюм 2013 fyum фюм 2013 induction extremal_choice invariant goal_existence fyum-2013-tur1a-p4 tsikl s summoy metok reber, delyascheysya na n, v polnom grafe, fyum 2013 fyum fyum 2013 induction extremal_choice invariant goal_existence"}
{"id":"fyum-2013-tur1b-p10","title":"Цикл с суммой меток рёбер, делящейся на p, в полном графе, ФЮМ 2013","path":"data\\problems\\fyum\\fyum-2013-tur1b-p10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2013-tur1b-p10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2013-tur1b-p10","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2013","tags":["goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2013-tur1b-p10 цикл с суммой меток рёбер, делящейся на p, в полном графе, фюм 2013 fyum фюм 2013 goal_existence fyum-2013-tur1b-p10 tsikl s summoy metok reber, delyascheysya na p, v polnom grafe, fyum 2013 fyum fyum 2013 goal_existence"}
{"id":"fyum-2013-tur2a-p1","title":"Раскраска рёбер планарного графа большого обхвата, ФЮМ 2013","path":"data\\problems\\fyum\\fyum-2013-tur2a-p1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/fyum/fyum-2013-tur2a-p1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#fyum-2013-tur2a-p1","source_key":"fyum","source_keys":["fyum"],"source_label":"ФЮМ","year":"2013","tags":["coloring","planar_graphs","minimal_counterexample","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"fyum-2013-tur2a-p1 раскраска рёбер планарного графа большого обхвата, фюм 2013 fyum фюм 2013 coloring planar_graphs minimal_counterexample goal_existence fyum-2013-tur2a-p1 raskraska reber planarnogo grafa bolshogo obhvata, fyum 2013 fyum fyum 2013 coloring planar_graphs minimal_counterexample goal_existence"}
{"id":"gabriel-graph-connected-separated-points","title":"Связность графа Габриэля для разреженного множества точек","path":"data\\problems\\classical\\gabriel-graph-connected-separated-points.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/gabriel-graph-connected-separated-points.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#gabriel-graph-connected-separated-points","source_key":"misc","source_keys":["misc","usamo"],"source_label":"Прочее","year":"","tags":["planar_graphs","connectivity","classical_theorem","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"gabriel-graph-connected-separated-points связность графа габриэля для разреженного множества точек misc прочее planar_graphs connectivity classical_theorem goal_proof gabriel-graph-connected-separated-points svyaznost grafa gabrielya dlya razrezhennogo mnozhestva tochek misc prochee planar_graphs connectivity classical_theorem goal_proof"}
{"id":"gabriel-graph-straight-line-planar","title":"Прямолинейная планарность графа Габриэля","path":"data\\problems\\classical\\gabriel-graph-straight-line-planar.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/gabriel-graph-straight-line-planar.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#gabriel-graph-straight-line-planar","source_key":"misc","source_keys":["misc","usamo"],"source_label":"Прочее","year":"","tags":["planar_graphs","classical_theorem","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"gabriel-graph-straight-line-planar прямолинейная планарность графа габриэля misc прочее planar_graphs classical_theorem goal_proof gabriel-graph-straight-line-planar pryamolineynaya planarnost grafa gabrielya misc prochee planar_graphs classical_theorem goal_proof"}
{"id":"gallai-hasse-roy-vitaver-theorem","title":"Теорема Галлаи-Хассе-Роя-Витавера о раскраске и ориентированных путях","path":"data\\problems\\classical\\gallai-hasse-roy-vitaver-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/gallai-hasse-roy-vitaver-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#gallai-hasse-roy-vitaver-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","classical_theorem","goal_characterization","extremal_choice"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"gallai-hasse-roy-vitaver-theorem теорема галлаи-хассе-роя-витавера о раскраске и ориентированных путях misc прочее coloring classical_theorem goal_characterization extremal_choice tibor gallai maria hasse bernard roy l. m. vitaver gallai-hasse-roy-vitaver-theorem teorema gallai-hasse-roya-vitavera o raskraske i orientirovannyh putyah misc prochee coloring classical_theorem goal_characterization extremal_choice tibor gallai maria hasse bernard roy l. m. vitaver"}
{"id":"gallai-three-color-disconnected-class","title":"Лемма Галлаи: в 3-раскраске без радужных треугольников есть несвязный цвет","path":"data\\problems\\classical\\gallai-three-color-disconnected-class.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/gallai-three-color-disconnected-class.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#gallai-three-color-disconnected-class","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","connectivity","classical_theorem","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"published_reference_with_transferred_proof","search_text":"gallai-three-color-disconnected-class лемма галлаи: в 3-раскраске без радужных треугольников есть несвязный цвет misc прочее coloring connectivity classical_theorem goal_proof tibor gallai andras gyarfas and gabor simonyi gallai-three-color-disconnected-class lemma gallai: v 3-raskraske bez raduzhnyh treugolnikov est nesvyaznyy tsvet misc prochee coloring connectivity classical_theorem goal_proof tibor gallai andras gyarfas and gabor simonyi"}
{"id":"ghrv-coloring-orientation-short-path","title":"Ориентация раскрашенного графа без слишком длинных ориентированных путей","path":"data\\problems\\classical\\ghrv-coloring-orientation-short-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ghrv-coloring-orientation-short-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ghrv-coloring-orientation-short-path","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","classical_lemma","goal_construction","potential_function"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"ghrv-coloring-orientation-short-path ориентация раскрашенного графа без слишком длинных ориентированных путей misc прочее coloring classical_lemma goal_construction potential_function tibor gallai maria hasse bernard roy l. m. vitaver ghrv-coloring-orientation-short-path orientatsiya raskrashennogo grafa bez slishkom dlinnyh orientirovannyh putey misc prochee coloring classical_lemma goal_construction potential_function tibor gallai maria hasse bernard roy l. m. vitaver"}
{"id":"ghrv-every-orientation-long-directed-path","title":"Длинный ориентированный путь в любой ориентации графа","path":"data\\problems\\classical\\ghrv-every-orientation-long-directed-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ghrv-every-orientation-long-directed-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ghrv-every-orientation-long-directed-path","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","classical_lemma","goal_bound","potential_function"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"ghrv-every-orientation-long-directed-path длинный ориентированный путь в любой ориентации графа misc прочее coloring classical_lemma goal_bound potential_function tibor gallai maria hasse bernard roy l. m. vitaver ghrv-every-orientation-long-directed-path dlinnyy orientirovannyy put v lyuboy orientatsii grafa misc prochee coloring classical_lemma goal_bound potential_function tibor gallai maria hasse bernard roy l. m. vitaver"}
{"id":"greedy-strong-edge-coloring-bound","title":"Жадная оценка сильной рёберной раскраски","path":"data\\problems\\classical\\greedy-strong-edge-coloring-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/greedy-strong-edge-coloring-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#greedy-strong-edge-coloring-bound","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["coloring","classical_theorem","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"greedy-strong-edge-coloring-bound жадная оценка сильной рёберной раскраски misc прочее coloring classical_theorem goal_bound greedy-strong-edge-coloring-bound zhadnaya otsenka silnoy rebernoy raskraski misc prochee coloring classical_theorem goal_bound"}
{"id":"grid-boundary-components-coloring-lemma","title":"Лемма о компонентах графа границ в двуцветной раскраске клетчатой доски","path":"data\\problems\\classical\\grid-boundary-components-coloring-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/grid-boundary-components-coloring-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#grid-boundary-components-coloring-lemma","source_key":"misc","source_keys":["misc","bmo"],"source_label":"Прочее","year":"","tags":["connectivity","coloring","planar_graphs","double_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"grid-boundary-components-coloring-lemma лемма о компонентах графа границ в двуцветной раскраске клетчатой доски misc прочее connectivity coloring planar_graphs double_counting goal_bound grid-boundary-components-coloring-lemma lemma o komponentah grafa granits v dvutsvetnoy raskraske kletchatoy doski misc prochee connectivity coloring planar_graphs double_counting goal_bound"}
{"id":"hall-marriage-theorem","title":"Теорема Холла о паросочетаниях","path":"data\\problems\\classical\\hall-marriage-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/hall-marriage-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#hall-marriage-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","classical_theorem","induction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"hall-marriage-theorem теорема холла о паросочетаниях misc прочее matching classical_theorem induction goal_characterization philip hall hall-marriage-theorem teorema holla o parosochetaniyah misc prochee matching classical_theorem induction goal_characterization philip hall"}
{"id":"handshaking-lemma","title":"Лемма о сумме степеней и чётности нечётных вершин","path":"data\\problems\\classical\\handshaking-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/handshaking-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#handshaking-lemma","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["double_counting","classical_theorem","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"handshaking-lemma лемма о сумме степеней и чётности нечётных вершин misc прочее double_counting classical_theorem goal_counting handshaking-lemma lemma o summe stepeney i chetnosti nechetnyh vershin misc prochee double_counting classical_theorem goal_counting"}
{"id":"havel-hakimi-graphical-degree-sequence","title":"Критерий Хавела-Хакими для графических последовательностей степеней","path":"data\\problems\\classical\\havel-hakimi-graphical-degree-sequence.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/havel-hakimi-graphical-degree-sequence.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#havel-hakimi-graphical-degree-sequence","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["classical_theorem","goal_characterization","goal_algorithm","induction","extremal_choice"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"havel-hakimi-graphical-degree-sequence критерий хавела-хакими для графических последовательностей степеней misc прочее classical_theorem goal_characterization goal_algorithm induction extremal_choice václav havel sam hakimi havel-hakimi-graphical-degree-sequence kriteriy havela-hakimi dlya graficheskih posledovatelnostey stepeney misc prochee classical_theorem goal_characterization goal_algorithm induction extremal_choice václav havel sam hakimi"}
{"id":"hse-2024-final-11-p5-rock-paper-scissors-tree","title":"Стабилизация игры «камень, ножницы, бумага» на дереве, «Высшая проба» 2024","path":"data\\problems\\hse\\hse-2024-final-11-p5-rock-paper-scissors-tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/hse/hse-2024-final-11-p5-rock-paper-scissors-tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#hse-2024-final-11-p5-rock-paper-scissors-tree","source_key":"hse","source_keys":["hse","lktg"],"source_label":"«Высшая проба»","year":"2024","tags":["trees","coloring","dynamics","process_invariant","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution","search_text":"hse-2024-final-11-p5-rock-paper-scissors-tree стабилизация игры «камень, ножницы, бумага» на дереве, «высшая проба» 2024 hse «высшая проба» 2024 trees coloring dynamics process_invariant goal_proof hse-2024-final-11-p5-rock-paper-scissors-tree stabilizatsiya igry «kamen, nozhnitsy, bumaga» na dereve, «vysshaya proba» 2024 hse «vysshaya proba» 2024 trees coloring dynamics process_invariant goal_proof"}
{"id":"imc-1997-day1-p6-intersecting-families-finite-transversal","title":"Пересекающиеся семейства конечных подмножеств и конечный носитель пересечений, IMC 1997 Day 1 P6","path":"data\\problems\\imc\\imc-1997-day1-p6-intersecting-families-finite-transversal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-1997-day1-p6-intersecting-families-finite-transversal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-1997-day1-p6-intersecting-families-finite-transversal","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"1997","tags":["graph_model","induction","construction","goal_proof","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-1997-day1-p6-intersecting-families-finite-transversal пересекающиеся семейства конечных подмножеств и конечный носитель пересечений, imc 1997 day 1 p6 imc imc 1997 graph_model induction construction goal_proof goal_impossibility imc-1997-day1-p6-intersecting-families-finite-transversal peresekayuschiesya semeystva konechnyh podmnozhestv i konechnyy nositel peresecheniy, imc 1997 day 1 p6 imc imc 1997 graph_model induction construction goal_proof goal_impossibility"}
{"id":"imc-1997-day1-p6a-intersecting-families-no-finite-transversal","title":"Пересекающееся семейство без конечного носителя попарных пересечений, IMC 1997 Day 1 P6(a)","path":"data\\problems\\imc\\imc-1997-day1-p6a-intersecting-families-no-finite-transversal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-1997-day1-p6a-intersecting-families-no-finite-transversal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-1997-day1-p6a-intersecting-families-no-finite-transversal","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"1997","tags":["construction","graph_model","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-1997-day1-p6a-intersecting-families-no-finite-transversal пересекающееся семейство без конечного носителя попарных пересечений, imc 1997 day 1 p6(a) imc imc 1997 construction graph_model goal_impossibility imc-1997-day1-p6a-intersecting-families-no-finite-transversal peresekayuscheesya semeystvo bez konechnogo nositelya poparnyh peresecheniy, imc 1997 day 1 p6(a) imc imc 1997 construction graph_model goal_impossibility"}
{"id":"imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal","title":"Конечный носитель попарных пересечений для равномерного пересекающегося семейства, IMC 1997 Day 1 P6(b)","path":"data\\problems\\imc\\imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"1997","tags":["graph_model","induction","goal_proof","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal конечный носитель попарных пересечений для равномерного пересекающегося семейства, imc 1997 day 1 p6(b) imc imc 1997 graph_model induction goal_proof goal_existence imc-1997-day1-p6b-uniform-intersecting-families-finite-transversal konechnyy nositel poparnyh peresecheniy dlya ravnomernogo peresekayuschegosya semeystva, imc 1997 day 1 p6(b) imc imc 1997 graph_model induction goal_proof goal_existence"}
{"id":"imc-1999-day1-p5-marked-grid-cycle","title":"Цикл в двудольном графе строк и столбцов, IMC 1999 Day 1 P5","path":"data\\problems\\imc\\imc-1999-day1-p5-marked-grid-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-1999-day1-p5-marked-grid-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-1999-day1-p5-marked-grid-cycle","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"1999","tags":["graph_model","connectivity","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-1999-day1-p5-marked-grid-cycle цикл в двудольном графе строк и столбцов, imc 1999 day 1 p5 imc imc 1999 graph_model connectivity double_counting goal_existence imc-1999-day1-p5-marked-grid-cycle tsikl v dvudolnom grafe strok i stolbtsov, imc 1999 day 1 p5 imc imc 1999 graph_model connectivity double_counting goal_existence"}
{"id":"imc-2001-day2-p4-zero-principal-minors-acyclic-digraph","title":"Нулевые главные миноры и ациклический граф ненулевых элементов, IMC 2001 Day 2 P4","path":"data\\problems\\imc\\imc-2001-day2-p4-zero-principal-minors-acyclic-digraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2001-day2-p4-zero-principal-minors-acyclic-digraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2001-day2-p4-zero-principal-minors-acyclic-digraph","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2001","tags":["graph_in_solution","minimal_counterexample","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2001-day2-p4-zero-principal-minors-acyclic-digraph нулевые главные миноры и ациклический граф ненулевых элементов, imc 2001 day 2 p4 imc imc 2001 graph_in_solution minimal_counterexample goal_proof imc-2001-day2-p4-zero-principal-minors-acyclic-digraph nulevye glavnye minory i atsiklicheskiy graf nenulevyh elementov, imc 2001 day 2 p4 imc imc 2001 graph_in_solution minimal_counterexample goal_proof"}
{"id":"imc-2002-day2-p2-students-problems-dominating-pair","title":"Доминирующая пара в двудольном графе, IMC 2002 Day 2 P2","path":"data\\problems\\imc\\imc-2002-day2-p2-students-problems-dominating-pair.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2002-day2-p2-students-problems-dominating-pair.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2002-day2-p2-students-problems-dominating-pair","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2002","tags":["graph_model","double_counting","pigeonhole_principle","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2002-day2-p2-students-problems-dominating-pair доминирующая пара в двудольном графе, imc 2002 day 2 p2 imc imc 2002 graph_model double_counting pigeonhole_principle goal_existence imc-2002-day2-p2-students-problems-dominating-pair dominiruyuschaya para v dvudolnom grafe, imc 2002 day 2 p2 imc imc 2002 graph_model double_counting pigeonhole_principle goal_existence"}
{"id":"imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group","title":"Тройки Штейнера с замыканием и порядок \\(2^m-1\\), IMC 2003 Day 2 P4","path":"data\\problems\\imc\\imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2003","tags":["graph_model","construction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group тройки штейнера с замыканием и порядок \\(2^m-1\\), imc 2003 day 2 p4 imc imc 2003 graph_model construction goal_characterization imc-2003-day2-p4-steiner-triples-elementary-abelian-2-group troyki shteynera s zamykaniem i poryadok \\(2^m-1\\), imc 2003 day 2 p4 imc imc 2003 graph_model construction goal_characterization"}
{"id":"imc-2006-day2-p1-polygon-triangulation-parity","title":"Триангуляция многоугольника с заданной чётностью вершин, IMC 2006 Day 2 P1","path":"data\\problems\\imc\\imc-2006-day2-p1-polygon-triangulation-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2006-day2-p1-polygon-triangulation-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2006-day2-p1-polygon-triangulation-parity","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2006","tags":["planar_graphs","induction","parity_coloring","construction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2006-day2-p1-polygon-triangulation-parity триангуляция многоугольника с заданной чётностью вершин, imc 2006 day 2 p1 imc imc 2006 planar_graphs induction parity_coloring construction goal_construction imc-2006-day2-p1-polygon-triangulation-parity triangulyatsiya mnogougolnika s zadannoy chetnostyu vershin, imc 2006 day 2 p1 imc imc 2006 planar_graphs induction parity_coloring construction goal_construction"}
{"id":"imc-2006-day2-p1a-polygon-triangulation-all-odd","title":"Триангуляция многоугольника с нечётной инцидентностью, IMC 2006 Day 2 P1(a)","path":"data\\problems\\imc\\imc-2006-day2-p1a-polygon-triangulation-all-odd.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2006-day2-p1a-polygon-triangulation-all-odd.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2006-day2-p1a-polygon-triangulation-all-odd","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2006","tags":["planar_graphs","induction","parity_coloring","construction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2006-day2-p1a-polygon-triangulation-all-odd триангуляция многоугольника с нечётной инцидентностью, imc 2006 day 2 p1(a) imc imc 2006 planar_graphs induction parity_coloring construction goal_construction imc-2006-day2-p1a-polygon-triangulation-all-odd triangulyatsiya mnogougolnika s nechetnoy intsidentnostyu, imc 2006 day 2 p1(a) imc imc 2006 planar_graphs induction parity_coloring construction goal_construction"}
{"id":"imc-2006-day2-p1b-polygon-triangulation-two-even","title":"Триангуляция многоугольника с двумя чётными вершинами, IMC 2006 Day 2 P1(b)","path":"data\\problems\\imc\\imc-2006-day2-p1b-polygon-triangulation-two-even.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2006-day2-p1b-polygon-triangulation-two-even.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2006-day2-p1b-polygon-triangulation-two-even","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2006","tags":["planar_graphs","induction","parity_coloring","construction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2006-day2-p1b-polygon-triangulation-two-even триангуляция многоугольника с двумя чётными вершинами, imc 2006 day 2 p1(b) imc imc 2006 planar_graphs induction parity_coloring construction goal_construction imc-2006-day2-p1b-polygon-triangulation-two-even triangulyatsiya mnogougolnika s dvumya chetnymi vershinami, imc 2006 day 2 p1(b) imc imc 2006 planar_graphs induction parity_coloring construction goal_construction"}
{"id":"imc-2009-day1-p3-friendship-girth-five","title":"Граф знакомств с диаметром два и кратчайшим циклом, IMC 2009 Day 1 P3","path":"data\\problems\\imc\\imc-2009-day1-p3-friendship-girth-five.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2009-day1-p3-friendship-girth-five.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2009-day1-p3-friendship-girth-five","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2009","tags":["connectivity","degree_counting","double_counting","forbidden_triangle","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2009-day1-p3-friendship-girth-five граф знакомств с диаметром два и кратчайшим циклом, imc 2009 day 1 p3 imc imc 2009 connectivity degree_counting double_counting forbidden_triangle goal_exact_bound imc-2009-day1-p3-friendship-girth-five graf znakomstv s diametrom dva i kratchayshim tsiklom, imc 2009 day 1 p3 imc imc 2009 connectivity degree_counting double_counting forbidden_triangle goal_exact_bound"}
{"id":"imc-2010-day2-p4-f2-adjacency-matrix-zero-entry","title":"Маршруты нечётной кратности в графе, IMC 2010 Day 2 P4","path":"data\\problems\\imc\\imc-2010-day2-p4-f2-adjacency-matrix-zero-entry.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2010-day2-p4-f2-adjacency-matrix-zero-entry.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2010-day2-p4-f2-adjacency-matrix-zero-entry","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2010","tags":["graph_model","parity_coloring","invariant","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2010-day2-p4-f2-adjacency-matrix-zero-entry маршруты нечётной кратности в графе, imc 2010 day 2 p4 imc imc 2010 graph_model parity_coloring invariant induction goal_proof imc-2010-day2-p4-f2-adjacency-matrix-zero-entry marshruty nechetnoy kratnosti v grafe, imc 2010 day 2 p4 imc imc 2010 graph_model parity_coloring invariant induction goal_proof"}
{"id":"imc-2011-day2-p2-tripartite-married-triples","title":"Тройственные браки в плотном трёхдольном графе, IMC 2011 Day 2 P2","path":"data\\problems\\imc\\imc-2011-day2-p2-tripartite-married-triples.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2011-day2-p2-tripartite-married-triples.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2011-day2-p2-tripartite-married-triples","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2011","tags":["matching","construction","potential_function","degree_counting","extremal_graph_theory","graph_model","forbidden_triangle","goal_existence","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2011-day2-p2-tripartite-married-triples тройственные браки в плотном трёхдольном графе, imc 2011 day 2 p2 imc imc 2011 matching construction potential_function degree_counting extremal_graph_theory graph_model forbidden_triangle goal_existence goal_construction fedor duzhin nick gravin imc-2011-day2-p2-tripartite-married-triples troystvennye braki v plotnom trehdolnom grafe, imc 2011 day 2 p2 imc imc 2011 matching construction potential_function degree_counting extremal_graph_theory graph_model forbidden_triangle goal_existence goal_construction fedor duzhin nick gravin"}
{"id":"imc-2011-day2-p2a-tripartite-half-threshold-counterexample","title":"Контрпример без треугольников при пороге \\(k=n/2\\), IMC 2011 Day 2 P2(a)","path":"data\\problems\\imc\\imc-2011-day2-p2a-tripartite-half-threshold-counterexample.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2011-day2-p2a-tripartite-half-threshold-counterexample.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2011-day2-p2a-tripartite-half-threshold-counterexample","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2011","tags":["construction","forbidden_triangle","extremal_graph_theory","graph_model","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2011-day2-p2a-tripartite-half-threshold-counterexample контрпример без треугольников при пороге \\(k=n/2\\), imc 2011 day 2 p2(a) imc imc 2011 construction forbidden_triangle extremal_graph_theory graph_model goal_construction fedor duzhin nick gravin imc-2011-day2-p2a-tripartite-half-threshold-counterexample kontrprimer bez treugolnikov pri poroge \\(k=n/2\\), imc 2011 day 2 p2(a) imc imc 2011 construction forbidden_triangle extremal_graph_theory graph_model goal_construction fedor duzhin nick gravin"}
{"id":"imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover","title":"Совершенное покрытие треугольниками при \\(k\\ge 3n/4\\), IMC 2011 Day 2 P2(b)","path":"data\\problems\\imc\\imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2011","tags":["matching","degree_counting","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover совершенное покрытие треугольниками при \\(k\\ge 3n/4\\), imc 2011 day 2 p2(b) imc imc 2011 matching degree_counting graph_model goal_existence fedor duzhin nick gravin imc-2011-day2-p2b-tripartite-three-quarter-perfect-cover sovershennoe pokrytie treugolnikami pri \\(k\\ge 3n/4\\), imc 2011 day 2 p2(b) imc imc 2011 matching degree_counting graph_model goal_existence fedor duzhin nick gravin"}
{"id":"imc-2013-day1-p3-six-trips-cover-pairs","title":"Экскурсии, покрывающие все пары учеников, IMC 2013 Day 1 P3","path":"data\\problems\\imc\\imc-2013-day1-p3-six-trips-cover-pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2013-day1-p3-six-trips-cover-pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2013-day1-p3-six-trips-cover-pairs","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2013","tags":["double_counting","construction","graph_model","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2013-day1-p3-six-trips-cover-pairs экскурсии, покрывающие все пары учеников, imc 2013 day 1 p3 imc imc 2013 double_counting construction graph_model goal_exact_bound oleksandr rybak imc-2013-day1-p3-six-trips-cover-pairs ekskursii, pokryvayuschie vse pary uchenikov, imc 2013 day 1 p3 imc imc 2013 double_counting construction graph_model goal_exact_bound oleksandr rybak"}
{"id":"imc-2013-day2-p5-necklace-good-colorings-odd","title":"Нечётность числа раскрасок цикла без длинных белых дуг, IMC 2013 Day 2 P5","path":"data\\problems\\imc\\imc-2013-day2-p5-necklace-good-colorings-odd.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2013-day2-p5-necklace-good-colorings-odd.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2013-day2-p5-necklace-good-colorings-odd","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2013","tags":["coloring","parity_coloring","invariant","process_invariant","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2013-day2-p5-necklace-good-colorings-odd нечётность числа раскрасок цикла без длинных белых дуг, imc 2013 day 2 p5 imc imc 2013 coloring parity_coloring invariant process_invariant goal_proof vsevolod bykov oleksandr rybak imc-2013-day2-p5-necklace-good-colorings-odd nechetnost chisla raskrasok tsikla bez dlinnyh belyh dug, imc 2013 day 2 p5 imc imc 2013 coloring parity_coloring invariant process_invariant goal_proof vsevolod bykov oleksandr rybak"}
{"id":"imc-2018-day2-p6-path-orthogonal-representation","title":"Ортогональное представление дополнения пути, IMC 2018 Day 2 P6","path":"data\\problems\\imc\\imc-2018-day2-p6-path-orthogonal-representation.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2018-day2-p6-path-orthogonal-representation.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2018-day2-p6-path-orthogonal-representation","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2018","tags":["graph_model","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2018-day2-p6-path-orthogonal-representation ортогональное представление дополнения пути, imc 2018 day 2 p6 imc imc 2018 graph_model extremal_choice construction goal_exact_bound alexey balitskiy imc-2018-day2-p6-path-orthogonal-representation ortogonalnoe predstavlenie dopolneniya puti, imc 2018 day 2 p6 imc imc 2018 graph_model extremal_choice construction goal_exact_bound alexey balitskiy"}
{"id":"imc-2018-day2-p8-frog-lattice-paths","title":"Кратчайшие пути в решётчатой области, IMC 2018 Day 2 P8","path":"data\\problems\\imc\\imc-2018-day2-p8-frog-lattice-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2018-day2-p8-frog-lattice-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2018-day2-p8-frog-lattice-paths","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2018","tags":["graph_model","goal_counting","dynamics","invariant"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2018-day2-p8-frog-lattice-paths кратчайшие пути в решётчатой области, imc 2018 day 2 p8 imc imc 2018 graph_model goal_counting dynamics invariant fedor petrov anatoly vershik imc-2018-day2-p8-frog-lattice-paths kratchayshie puti v reshetchatoy oblasti, imc 2018 day 2 p8 imc imc 2018 graph_model goal_counting dynamics invariant fedor petrov anatoly vershik"}
{"id":"imc-2022-day1-p3-flea-cycle-recurrence","title":"Возвраты на цикле вычетов, IMC 2022 Day 1 P3","path":"data\\problems\\imc\\imc-2022-day1-p3-flea-cycle-recurrence.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2022-day1-p3-flea-cycle-recurrence.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2022-day1-p3-flea-cycle-recurrence","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2022","tags":["graph_model","dynamics","invariant","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2022-day1-p3-flea-cycle-recurrence возвраты на цикле вычетов, imc 2022 day 1 p3 imc imc 2022 graph_model dynamics invariant goal_counting fedor petrov imc-2022-day1-p3-flea-cycle-recurrence vozvraty na tsikle vychetov, imc 2022 day 1 p3 imc imc 2022 graph_model dynamics invariant goal_counting fedor petrov"}
{"id":"imc-2022-day1-p4-triples-chromatic-loglog","title":"Хроматическое число сдвигового графа троек, IMC 2022 Day 1 P4","path":"data\\problems\\imc\\imc-2022-day1-p4-triples-chromatic-loglog.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2022-day1-p4-triples-chromatic-loglog.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2022-day1-p4-triples-chromatic-loglog","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2022","tags":["coloring","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2022-day1-p4-triples-chromatic-loglog хроматическое число сдвигового графа троек, imc 2022 day 1 p4 imc imc 2022 coloring graph_model goal_bound danila cherkashin imc-2022-day1-p4-triples-chromatic-loglog hromaticheskoe chislo sdvigovogo grafa troek, imc 2022 day 1 p4 imc imc 2022 coloring graph_model goal_bound danila cherkashin"}
{"id":"imc-2022-day2-p5-regular-43-coloured-triangles","title":"Красно-синие треугольники в \\(K_{43}\\), IMC 2022 Day 2 P5","path":"data\\problems\\imc\\imc-2022-day2-p5-regular-43-coloured-triangles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2022-day2-p5-regular-43-coloured-triangles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2022-day2-p5-regular-43-coloured-triangles","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2022","tags":["double_counting","degree_counting","coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2022-day2-p5-regular-43-coloured-triangles красно-синие треугольники в \\(k_{43}\\), imc 2022 day 2 p5 imc imc 2022 double_counting degree_counting coloring goal_exact_bound mike daas imc-2022-day2-p5-regular-43-coloured-triangles krasno-sinie treugolniki v \\(k_{43}\\), imc 2022 day 2 p5 imc imc 2022 double_counting degree_counting coloring goal_exact_bound mike daas"}
{"id":"imc-2022-day2-p8-random-circle-hulls-colour-changes","title":"Пересечение выпуклых оболочек и смены цветов на цикле, IMC 2022 Day 2 P8","path":"data\\problems\\imc\\imc-2022-day2-p8-random-circle-hulls-colour-changes.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2022-day2-p8-random-circle-hulls-colour-changes.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2022-day2-p8-random-circle-hulls-colour-changes","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2022","tags":["graph_in_solution","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2022-day2-p8-random-circle-hulls-colour-changes пересечение выпуклых оболочек и смены цветов на цикле, imc 2022 day 2 p8 imc imc 2022 graph_in_solution double_counting goal_counting fedor petrov imc-2022-day2-p8-random-circle-hulls-colour-changes peresechenie vypuklyh obolochek i smeny tsvetov na tsikle, imc 2022 day 2 p8 imc imc 2022 graph_in_solution double_counting goal_counting fedor petrov"}
{"id":"imc-2023-day2-p8-tree-distance-wiener-harary","title":"Произведение сумм расстояний в дереве, IMC 2023 Day 2 P8","path":"data\\problems\\imc\\imc-2023-day2-p8-tree-distance-wiener-harary.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2023-day2-p8-tree-distance-wiener-harary.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2023-day2-p8-tree-distance-wiener-harary","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2023","tags":["trees","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2023-day2-p8-tree-distance-wiener-harary произведение сумм расстояний в дереве, imc 2023 day 2 p8 imc imc 2023 trees goal_bound slobodan filipovski imc-2023-day2-p8-tree-distance-wiener-harary proizvedenie summ rasstoyaniy v dereve, imc 2023 day 2 p8 imc imc 2023 trees goal_bound slobodan filipovski"}
{"id":"imc-2024-day2-p9-young-tableaux-friend-graph","title":"Чётность хороших матриц, IMC 2024 Day 2 P9","path":"data\\problems\\imc\\imc-2024-day2-p9-young-tableaux-friend-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2024-day2-p9-young-tableaux-friend-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2024-day2-p9-young-tableaux-friend-graph","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2024","tags":["graph_in_solution","degree_counting","double_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2024-day2-p9-young-tableaux-friend-graph чётность хороших матриц, imc 2024 day 2 p9 imc imc 2024 graph_in_solution degree_counting double_counting goal_proof fedor petrov imc-2024-day2-p9-young-tableaux-friend-graph chetnost horoshih matrits, imc 2024 day 2 p9 imc imc 2024 graph_in_solution degree_counting double_counting goal_proof fedor petrov"}
{"id":"imc-2026-day1-p3-alternating-shuffle-two-chains","title":"Перемешивание двух монотонных стопок и два пути, IMC 2026 Day 1 P3","path":"data\\problems\\imc\\imc-2026-day1-p3-alternating-shuffle-two-chains.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imc/imc-2026-day1-p3-alternating-shuffle-two-chains.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imc-2026-day1-p3-alternating-shuffle-two-chains","source_key":"imc","source_keys":["imc"],"source_label":"IMC","year":"2026","tags":["graph_in_solution","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imc-2026-day1-p3-alternating-shuffle-two-chains перемешивание двух монотонных стопок и два пути, imc 2026 day 1 p3 imc imc 2026 graph_in_solution goal_counting daniel volostnov imc-2026-day1-p3-alternating-shuffle-two-chains peremeshivanie dvuh monotonnyh stopok i dva puti, imc 2026 day 1 p3 imc imc 2026 graph_in_solution goal_counting daniel volostnov"}
{"id":"imo-1964-p4-three-topic-ramsey","title":"Трёхцветная раскраска \\(K_{17}\\) и одноцветный треугольник, IMO 1964 P4","path":"data\\problems\\imo\\imo-1964-p4-three-topic-ramsey.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1964-p4-three-topic-ramsey.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1964-p4-three-topic-ramsey","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"1964","tags":["ramsey_theory","coloring","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1964-p4-three-topic-ramsey трёхцветная раскраска \\(k_{17}\\) и одноцветный треугольник, imo 1964 p4 imo imo 1964 ramsey_theory coloring goal_existence imo-1964-p4-three-topic-ramsey trehtsvetnaya raskraska \\(k_{17}\\) i odnotsvetnyy treugolnik, imo 1964 p4 imo imo 1964 ramsey_theory coloring goal_existence"}
{"id":"imo-1979-p6-octagon-walks-cycle-graph","title":"Подсчёт маршрутов фишки на цикле \\(C_8\\), IMO 1979 P6","path":"data\\problems\\imo\\imo-1979-p6-octagon-walks-cycle-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1979-p6-octagon-walks-cycle-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1979-p6-octagon-walks-cycle-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"1979","tags":["graph_symmetry","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1979-p6-octagon-walks-cycle-graph подсчёт маршрутов фишки на цикле \\(c_8\\), imo 1979 p6 imo imo 1979 graph_symmetry double_counting goal_counting imo-1979-p6-octagon-walks-cycle-graph podschet marshrutov fishki na tsikle \\(c_8\\), imo 1979 p6 imo imo 1979 graph_symmetry double_counting goal_counting"}
{"id":"imo-1985-sl5-lattice-perfect-code","title":"Совершенное независимое множество в кубической решётке, IMO Shortlist 1985","path":"data\\problems\\imo\\imo-1985-sl5-lattice-perfect-code.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1985-sl5-lattice-perfect-code.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1985-sl5-lattice-perfect-code","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1985","tags":["coloring","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1985-sl5-lattice-perfect-code совершенное независимое множество в кубической решётке, imo shortlist 1985 imo imo shortlist 1985 coloring goal_characterization imo-1985-sl5-lattice-perfect-code sovershennoe nezavisimoe mnozhestvo v kubicheskoy reshetke, imo shortlist 1985 imo imo shortlist 1985 coloring goal_characterization"}
{"id":"imo-1986-sl12-increasing-edge-trail","title":"Возрастающая цепь рёбер в размеченном графе, IMO Shortlist 1986","path":"data\\problems\\imo\\imo-1986-sl12-increasing-edge-trail.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1986-sl12-increasing-edge-trail.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1986-sl12-increasing-edge-trail","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1986","tags":["extremal_choice","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1986-sl12-increasing-edge-trail возрастающая цепь рёбер в размеченном графе, imo shortlist 1986 imo imo shortlist 1986 extremal_choice goal_bound imo-1986-sl12-increasing-edge-trail vozrastayuschaya tsep reber v razmechennom grafe, imo shortlist 1986 imo imo shortlist 1986 extremal_choice goal_bound"}
{"id":"imo-1989-sl14-seven-points-triangle-cover","title":"Минимум рёбер в графе на 7 вершинах без независимой тройки, IMO Shortlist 1989","path":"data\\problems\\imo\\imo-1989-sl14-seven-points-triangle-cover.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1989-sl14-seven-points-triangle-cover.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1989-sl14-seven-points-triangle-cover","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1989","tags":["extremal_graph_theory","forbidden_triangle","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1989-sl14-seven-points-triangle-cover минимум рёбер в графе на 7 вершинах без независимой тройки, imo shortlist 1989 imo imo shortlist 1989 extremal_graph_theory forbidden_triangle goal_exact_bound imo-1989-sl14-seven-points-triangle-cover minimum reber v grafe na 7 vershinah bez nezavisimoy troyki, imo shortlist 1989 imo imo shortlist 1989 extremal_graph_theory forbidden_triangle goal_exact_bound"}
{"id":"imo-1991-p4-connected-graph-gcd-edge-labels","title":"Разметка рёбер связного графа взаимно простыми метками, IMO 1991 P4","path":"data\\problems\\imo\\imo-1991-p4-connected-graph-gcd-edge-labels.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1991-p4-connected-graph-gcd-edge-labels.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1991-p4-connected-graph-gcd-edge-labels","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"1991","tags":["trees","induction","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1991-p4-connected-graph-gcd-edge-labels разметка рёбер связного графа взаимно простыми метками, imo 1991 p4 imo imo 1991 trees induction extremal_choice goal_exact_bound imo-1991-p4-connected-graph-gcd-edge-labels razmetka reber svyaznogo grafa vzaimno prostymi metkami, imo 1991 p4 imo imo 1991 trees induction extremal_choice goal_exact_bound"}
{"id":"imo-1991-sl9-min-degree-for-k6","title":"Минимальная степень, гарантирующая клику \\(K_6\\), IMO Shortlist 1991","path":"data\\problems\\imo\\imo-1991-sl9-min-degree-for-k6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1991-sl9-min-degree-for-k6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1991-sl9-min-degree-for-k6","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1991","tags":["extremal_graph_theory","forbidden_clique","symmetrization","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1991-sl9-min-degree-for-k6 минимальная степень, гарантирующая клику \\(k_6\\), imo shortlist 1991 imo imo shortlist 1991 extremal_graph_theory forbidden_clique symmetrization goal_exact_bound imo-1991-sl9-min-degree-for-k6 minimalnaya stepen, garantiruyuschaya kliku \\(k_6\\), imo shortlist 1991 imo imo shortlist 1991 extremal_graph_theory forbidden_clique symmetrization goal_exact_bound"}
{"id":"imo-1992-p3-nine-points-partial-ramsey","title":"Девять точек и минимальное число окрашенных рёбер, IMO 1992 P3","path":"data\\problems\\imo\\imo-1992-p3-nine-points-partial-ramsey.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1992-p3-nine-points-partial-ramsey.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1992-p3-nine-points-partial-ramsey","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"1992","tags":["ramsey_theory","coloring","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1992-p3-nine-points-partial-ramsey девять точек и минимальное число окрашенных рёбер, imo 1992 p3 imo imo 1992 ramsey_theory coloring extremal_graph_theory goal_exact_bound imo-1992-p3-nine-points-partial-ramsey devyat tochek i minimalnoe chislo okrashennyh reber, imo 1992 p3 imo imo 1992 ramsey_theory coloring extremal_graph_theory goal_exact_bound"}
{"id":"imo-1994-c2-city-ages-harmonic-graph","title":"Возраст горожан и гармоническая функция на графе, IMO Shortlist 1994 C2","path":"data\\problems\\imo\\imo-1994-c2-city-ages-harmonic-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1994-c2-city-ages-harmonic-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1994-c2-city-ages-harmonic-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1994","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1994-c2-city-ages-harmonic-graph возраст горожан и гармоническая функция на графе, imo shortlist 1994 c2 imo imo shortlist 1994 connectivity goal_exact_bound imo-1994-c2-city-ages-harmonic-graph vozrast gorozhan i garmonicheskaya funktsiya na grafe, imo shortlist 1994 c2 imo imo shortlist 1994 connectivity goal_exact_bound"}
{"id":"imo-1994-c6-infinite-grid-pairing-strategy","title":"Бесконечные крестики-нолики: запрет 11 подряд, IMO Shortlist 1994 C6","path":"data\\problems\\imo\\imo-1994-c6-infinite-grid-pairing-strategy.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1994-c6-infinite-grid-pairing-strategy.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1994-c6-infinite-grid-pairing-strategy","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1994","tags":["matching","coloring","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1994-c6-infinite-grid-pairing-strategy бесконечные крестики-нолики: запрет 11 подряд, imo shortlist 1994 c6 imo imo shortlist 1994 matching coloring goal_strategy_game imo-1994-c6-infinite-grid-pairing-strategy beskonechnye krestiki-noliki: zapret 11 podryad, imo shortlist 1994 c6 imo imo shortlist 1994 matching coloring goal_strategy_game"}
{"id":"imo-1995-nc5-greetings-regular-codegree-graph","title":"Рукопожатия с постоянным числом общих знакомых, IMO Shortlist 1995 NC5","path":"data\\problems\\imo\\imo-1995-nc5-greetings-regular-codegree-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1995-nc5-greetings-regular-codegree-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1995-nc5-greetings-regular-codegree-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1995","tags":["double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1995-nc5-greetings-regular-codegree-graph рукопожатия с постоянным числом общих знакомых, imo shortlist 1995 nc5 imo imo shortlist 1995 double_counting goal_counting imo-1995-nc5-greetings-regular-codegree-graph rukopozhatiya s postoyannym chislom obschih znakomyh, imo shortlist 1995 nc5 imo imo shortlist 1995 double_counting goal_counting"}
{"id":"imo-1996-c1-grid-knight-reachability-divisible-2-or-3","title":"Недостижимость в графе ходов при \\(r\\), делящемся на 2 или 3, IMO Shortlist 1996 C1","path":"data\\problems\\imo\\imo-1996-c1-grid-knight-reachability-divisible-2-or-3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1996-c1-grid-knight-reachability-divisible-2-or-3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1996-c1-grid-knight-reachability-divisible-2-or-3","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1996","tags":["connectivity","coloring","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1996-c1-grid-knight-reachability-divisible-2-or-3 недостижимость в графе ходов при \\(r\\), делящемся на 2 или 3, imo shortlist 1996 c1 imo imo shortlist 1996 connectivity coloring goal_impossibility imo-1996-c1-grid-knight-reachability-divisible-2-or-3 nedostizhimost v grafe hodov pri \\(r\\), delyaschemsya na 2 ili 3, imo shortlist 1996 c1 imo imo shortlist 1996 connectivity coloring goal_impossibility"}
{"id":"imo-1996-c1-grid-knight-reachability-r73-path","title":"Явный путь в графе ходов при \\(r=73\\), IMO Shortlist 1996 C1","path":"data\\problems\\imo\\imo-1996-c1-grid-knight-reachability-r73-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1996-c1-grid-knight-reachability-r73-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1996-c1-grid-knight-reachability-r73-path","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1996","tags":["connectivity","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1996-c1-grid-knight-reachability-r73-path явный путь в графе ходов при \\(r=73\\), imo shortlist 1996 c1 imo imo shortlist 1996 connectivity goal_existence imo-1996-c1-grid-knight-reachability-r73-path yavnyy put v grafe hodov pri \\(r=73\\), imo shortlist 1996 c1 imo imo shortlist 1996 connectivity goal_existence"}
{"id":"imo-1996-c1-grid-knight-reachability-r97-impossible","title":"Недостижимость в графе ходов при \\(r=97\\), IMO Shortlist 1996 C1","path":"data\\problems\\imo\\imo-1996-c1-grid-knight-reachability-r97-impossible.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1996-c1-grid-knight-reachability-r97-impossible.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1996-c1-grid-knight-reachability-r97-impossible","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1996","tags":["connectivity","coloring","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1996-c1-grid-knight-reachability-r97-impossible недостижимость в графе ходов при \\(r=97\\), imo shortlist 1996 c1 imo imo shortlist 1996 connectivity coloring goal_impossibility imo-1996-c1-grid-knight-reachability-r97-impossible nedostizhimost v grafe hodov pri \\(r=97\\), imo shortlist 1996 c1 imo imo shortlist 1996 connectivity coloring goal_impossibility"}
{"id":"imo-1996-c2-grid-vertices-two-red","title":"Раскраски решётки с двумя красными вершинами в каждом квадрате, IMO Shortlist 1996 C2","path":"data\\problems\\imo\\imo-1996-c2-grid-vertices-two-red.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1996-c2-grid-vertices-two-red.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1996-c2-grid-vertices-two-red","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1996","tags":["coloring","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1996-c2-grid-vertices-two-red раскраски решётки с двумя красными вершинами в каждом квадрате, imo shortlist 1996 c2 imo imo shortlist 1996 coloring double_counting goal_counting imo-1996-c2-grid-vertices-two-red raskraski reshetki s dvumya krasnymi vershinami v kazhdom kvadrate, imo shortlist 1996 c2 imo imo shortlist 1996 coloring double_counting goal_counting"}
{"id":"imo-1998-c6-k-ge-6-one-factorization","title":"Раскраска рёбер \\(K_{10}\\) для \\(6\\le k\\le10\\), IMO Shortlist 1998 C6","path":"data\\problems\\imo\\imo-1998-c6-k-ge-6-one-factorization.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1998-c6-k-ge-6-one-factorization.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1998-c6-k-ge-6-one-factorization","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1998","tags":["coloring","matching","goal_construction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1998-c6-k-ge-6-one-factorization раскраска рёбер \\(k_{10}\\) для \\(6\\le k\\le10\\), imo shortlist 1998 c6 imo imo shortlist 1998 coloring matching goal_construction goal_existence imo-1998-c6-k-ge-6-one-factorization raskraska reber \\(k_{10}\\) dlya \\(6\\le k\\le10\\), imo shortlist 1998 c6 imo imo shortlist 1998 coloring matching goal_construction goal_existence"}
{"id":"imo-1998-c6-k-le-4-rainbow-edges-impossible","title":"Невозможность раскраски рёбер \\(K_{10}\\) при \\(k\\le 4\\), IMO Shortlist 1998 C6","path":"data\\problems\\imo\\imo-1998-c6-k-le-4-rainbow-edges-impossible.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1998-c6-k-le-4-rainbow-edges-impossible.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1998-c6-k-le-4-rainbow-edges-impossible","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1998","tags":["coloring","ramsey_theory","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1998-c6-k-le-4-rainbow-edges-impossible невозможность раскраски рёбер \\(k_{10}\\) при \\(k\\le 4\\), imo shortlist 1998 c6 imo imo shortlist 1998 coloring ramsey_theory goal_impossibility imo-1998-c6-k-le-4-rainbow-edges-impossible nevozmozhnost raskraski reber \\(k_{10}\\) pri \\(k\\le 4\\), imo shortlist 1998 c6 imo imo shortlist 1998 coloring ramsey_theory goal_impossibility"}
{"id":"imo-1998-c6-k5-rainbow-edges-construction","title":"Пятицветная раскраска рёбер \\(K_{10}\\) с пятью цветами на любых пяти вершинах, IMO Shortlist 1998 C6","path":"data\\problems\\imo\\imo-1998-c6-k5-rainbow-edges-construction.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1998-c6-k5-rainbow-edges-construction.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1998-c6-k5-rainbow-edges-construction","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"1998","tags":["coloring","goal_construction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1998-c6-k5-rainbow-edges-construction пятицветная раскраска рёбер \\(k_{10}\\) с пятью цветами на любых пяти вершинах, imo shortlist 1998 c6 imo imo shortlist 1998 coloring goal_construction goal_existence imo-1998-c6-k5-rainbow-edges-construction pyatitsvetnaya raskraska reber \\(k_{10}\\) s pyatyu tsvetami na lyubyh pyati vershinah, imo shortlist 1998 c6 imo imo shortlist 1998 coloring goal_construction goal_existence"}
{"id":"imo-1999-c5-grid-total-domination","title":"Минимальное тотально доминирующее множество на решётке, IMO 1999 P3","path":"data\\problems\\imo\\imo-1999-c5-grid-total-domination.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-1999-c5-grid-total-domination.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-1999-c5-grid-total-domination","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"1999","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-1999-c5-grid-total-domination минимальное тотально доминирующее множество на решётке, imo 1999 p3 imo imo 1999 coloring goal_exact_bound imo-1999-c5-grid-total-domination minimalnoe totalno dominiruyuschee mnozhestvo na reshetke, imo 1999 p3 imo imo 1999 coloring goal_exact_bound"}
{"id":"imo-2004-c3-delete-edge-from-4cycle","title":"Минимум рёбер после удалений из 4-циклов \\(K_n\\), IMO Shortlist 2004 C3","path":"data\\problems\\imo\\imo-2004-c3-delete-edge-from-4cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2004-c3-delete-edge-from-4cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2004-c3-delete-edge-from-4cycle","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2004","tags":["connectivity","trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2004-c3-delete-edge-from-4cycle минимум рёбер после удалений из 4-циклов \\(k_n\\), imo shortlist 2004 c3 imo imo shortlist 2004 connectivity trees goal_exact_bound imo-2004-c3-delete-edge-from-4cycle minimum reber posle udaleniy iz 4-tsiklov \\(k_n\\), imo shortlist 2004 c3 imo imo shortlist 2004 connectivity trees goal_exact_bound"}
{"id":"imo-2004-c8-triangles-tetrahedra-graph","title":"Треугольники и тетраэдры в конечном графе, IMO Shortlist 2004 C8","path":"data\\problems\\imo\\imo-2004-c8-triangles-tetrahedra-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2004-c8-triangles-tetrahedra-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2004-c8-triangles-tetrahedra-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2004","tags":["extremal_graph_theory","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2004-c8-triangles-tetrahedra-graph треугольники и тетраэдры в конечном графе, imo shortlist 2004 c8 imo imo shortlist 2004 extremal_graph_theory double_counting goal_exact_bound imo-2004-c8-triangles-tetrahedra-graph treugolniki i tetraedry v konechnom grafe, imo shortlist 2004 c8 imo imo shortlist 2004 extremal_graph_theory double_counting goal_exact_bound"}
{"id":"imo-2005-c2-dynastic-vertices-forest","title":"Династические вершины в бинарном лесу, IMO Shortlist 2005 C2","path":"data\\problems\\imo\\imo-2005-c2-dynastic-vertices-forest.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2005-c2-dynastic-vertices-forest.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2005-c2-dynastic-vertices-forest","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2005","tags":["trees","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2005-c2-dynastic-vertices-forest династические вершины в бинарном лесу, imo shortlist 2005 c2 imo imo shortlist 2005 trees induction goal_exact_bound imo-2005-c2-dynastic-vertices-forest dinasticheskie vershiny v binarnom lesu, imo shortlist 2005 c2 imo imo shortlist 2005 trees induction goal_exact_bound"}
{"id":"imo-2005-c3-black-paths-injection","title":"Чёрные пути через прямоугольную доску, IMO Shortlist 2005 C3","path":"data\\problems\\imo\\imo-2005-c3-black-paths-injection.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2005-c3-black-paths-injection.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2005-c3-black-paths-injection","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2005","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"imo-2005-c3-black-paths-injection чёрные пути через прямоугольную доску, imo shortlist 2005 c3 imo imo shortlist 2005 connectivity goal_exact_bound imo-2005-c3-black-paths-injection chernye puti cherez pryamougolnuyu dosku, imo shortlist 2005 c3 imo imo shortlist 2005 connectivity goal_exact_bound"}
{"id":"imo-2005-c8-noncrossing-diagonals-crossings","title":"Пересечения диагоналей двух триангуляций, IMO Shortlist 2005 C8","path":"data\\problems\\imo\\imo-2005-c8-noncrossing-diagonals-crossings.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2005-c8-noncrossing-diagonals-crossings.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2005-c8-noncrossing-diagonals-crossings","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2005","tags":["planar_graphs","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2005-c8-noncrossing-diagonals-crossings пересечения диагоналей двух триангуляций, imo shortlist 2005 c8 imo imo shortlist 2005 planar_graphs double_counting goal_exact_bound imo-2005-c8-noncrossing-diagonals-crossings peresecheniya diagonaley dvuh triangulyatsiy, imo shortlist 2005 c8 imo imo shortlist 2005 planar_graphs double_counting goal_exact_bound"}
{"id":"imo-2010-c2-flags-diagonal-matching","title":"Минимум флагов для одноцветной диагонали, IMO Shortlist 2010 C2","path":"data\\problems\\imo\\imo-2010-c2-flags-diagonal-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2010-c2-flags-diagonal-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2010-c2-flags-diagonal-matching","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2010","tags":["matching","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_tool_application","search_text":"imo-2010-c2-flags-diagonal-matching минимум флагов для одноцветной диагонали, imo shortlist 2010 c2 imo imo shortlist 2010 matching extremal_choice goal_exact_bound imo-2010-c2-flags-diagonal-matching minimum flagov dlya odnotsvetnoy diagonali, imo shortlist 2010 c2 imo imo shortlist 2010 matching extremal_choice goal_exact_bound"}
{"id":"imo-2010-c5-bad-company-tournament","title":"Теннисный турнир без плохой четвёрки, IMO Shortlist 2010 C5","path":"data\\problems\\imo\\imo-2010-c5-bad-company-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2010-c5-bad-company-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2010-c5-bad-company-tournament","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2010","tags":["tournaments","double_counting","goal_proof"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2010-c5-bad-company-tournament теннисный турнир без плохой четвёрки, imo shortlist 2010 c5 imo imo shortlist 2010 tournaments double_counting goal_proof imo-2010-c5-bad-company-tournament tennisnyy turnir bez plohoy chetverki, imo shortlist 2010 c5 imo imo shortlist 2010 tournaments double_counting goal_proof"}
{"id":"imo-2012-c7-equal-sum-chords-independent-set","title":"Равные суммы на непересекающихся хордах, IMO Shortlist 2012 C7","path":"data\\problems\\imo\\imo-2012-c7-equal-sum-chords-independent-set.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2012-c7-equal-sum-chords-independent-set.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2012-c7-equal-sum-chords-independent-set","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2012","tags":["extremal_graph_theory","induction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2012-c7-equal-sum-chords-independent-set равные суммы на непересекающихся хордах, imo shortlist 2012 c7 imo imo shortlist 2012 extremal_graph_theory induction goal_characterization imo-2012-c7-equal-sum-chords-independent-set ravnye summy na neperesekayuschihsya hordah, imo shortlist 2012 c7 imo imo shortlist 2012 extremal_graph_theory induction goal_characterization"}
{"id":"imo-2013-c3-imons-graph-coloring","title":"Имоны, удвоение и раскраска графа, IMO Shortlist 2013 C3","path":"data\\problems\\imo\\imo-2013-c3-imons-graph-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2013-c3-imons-graph-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2013-c3-imons-graph-coloring","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2013","tags":["coloring","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2013-c3-imons-graph-coloring имоны, удвоение и раскраска графа, imo shortlist 2013 c3 imo imo shortlist 2013 coloring induction goal_proof imo-2013-c3-imons-graph-coloring imony, udvoenie i raskraska grafa, imo shortlist 2013 c3 imo imo shortlist 2013 coloring induction goal_proof"}
{"id":"imo-2014-c9-snail-circles-tree","title":"Улитка на окружностях и дерево областей, IMO Shortlist 2014 C9","path":"data\\problems\\imo\\imo-2014-c9-snail-circles-tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2014-c9-snail-circles-tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2014-c9-snail-circles-tree","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2014","tags":["trees","planar_graphs","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2014-c9-snail-circles-tree улитка на окружностях и дерево областей, imo shortlist 2014 c9 imo imo shortlist 2014 trees planar_graphs double_counting goal_counting imo-2014-c9-snail-circles-tree ulitka na okruzhnostyah i derevo oblastey, imo shortlist 2014 c9 imo imo shortlist 2014 trees planar_graphs double_counting goal_counting"}
{"id":"imo-2016-c6-ferry-graph-dynamics","title":"Паромы и появление универсального острова, IMO Shortlist 2016 C6","path":"data\\problems\\imo\\imo-2016-c6-ferry-graph-dynamics.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2016-c6-ferry-graph-dynamics.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2016-c6-ferry-graph-dynamics","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2016","tags":["connectivity","graph_cut","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2016-c6-ferry-graph-dynamics паромы и появление универсального острова, imo shortlist 2016 c6 imo imo shortlist 2016 connectivity graph_cut goal_existence imo-2016-c6-ferry-graph-dynamics paromy i poyavlenie universalnogo ostrova, imo shortlist 2016 c6 imo imo shortlist 2016 connectivity graph_cut goal_existence"}
{"id":"imo-2016-c8-domino-unique-tiling-cycles","title":"Домино и отмеченные клетки, IMO Shortlist 2016 C8","path":"data\\problems\\imo\\imo-2016-c8-domino-unique-tiling-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2016-c8-domino-unique-tiling-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2016-c8-domino-unique-tiling-cycles","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2016","tags":["matching","graph_symmetry","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2016-c8-domino-unique-tiling-cycles домино и отмеченные клетки, imo shortlist 2016 c8 imo imo shortlist 2016 matching graph_symmetry goal_exact_bound imo-2016-c8-domino-unique-tiling-cycles domino i otmechennye kletki, imo shortlist 2016 c8 imo imo shortlist 2016 matching graph_symmetry goal_exact_bound"}
{"id":"imo-2019-c3-coin-process-digraph","title":"Процесс с монетами на двоичных строках, IMO Shortlist 2019 C3","path":"data\\problems\\imo\\imo-2019-c3-coin-process-digraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2019-c3-coin-process-digraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2019-c3-coin-process-digraph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2019","tags":["induction","invariant","goal_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2019-c3-coin-process-digraph процесс с монетами на двоичных строках, imo shortlist 2019 c3 imo imo shortlist 2019 induction invariant goal_counting goal_proof david altizio imo-2019-c3-coin-process-digraph protsess s monetami na dvoichnyh strokah, imo shortlist 2019 c3 imo imo shortlist 2019 induction invariant goal_counting goal_proof david altizio"}
{"id":"imo-2019-c4-labyrinth-region-graph","title":"Лабиринт из прямых и граф областей, IMO Shortlist 2019 C4","path":"data\\problems\\imo\\imo-2019-c4-labyrinth-region-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2019-c4-labyrinth-region-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2019-c4-labyrinth-region-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2019","tags":["connectivity","planar_graphs","double_counting","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2019-c4-labyrinth-region-graph лабиринт из прямых и граф областей, imo shortlist 2019 c4 imo imo shortlist 2019 connectivity planar_graphs double_counting goal_characterization imo-2019-c4-labyrinth-region-graph labirint iz pryamyh i graf oblastey, imo shortlist 2019 c4 imo imo shortlist 2019 connectivity planar_graphs double_counting goal_characterization"}
{"id":"imo-2019-c5-social-network-refriending","title":"Социальная сеть и операция пере-дружбы, IMO Shortlist 2019 C5","path":"data\\problems\\imo\\imo-2019-c5-social-network-refriending.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2019-c5-social-network-refriending.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2019-c5-social-network-refriending","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2019","tags":["connectivity","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2019-c5-social-network-refriending социальная сеть и операция пере-дружбы, imo shortlist 2019 c5 imo imo shortlist 2019 connectivity extremal_choice goal_exact_bound imo-2019-c5-social-network-refriending sotsialnaya set i operatsiya pere-druzhby, imo shortlist 2019 c5 imo imo shortlist 2019 connectivity extremal_choice goal_exact_bound"}
{"id":"imo-2020-c4-fibonacci-difference-forest","title":"Разности Фибоначчи и лес, IMO Shortlist 2020 C4","path":"data\\problems\\imo\\imo-2020-c4-fibonacci-difference-forest.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2020-c4-fibonacci-difference-forest.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2020-c4-fibonacci-difference-forest","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2020","tags":["trees","graph_in_solution","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2020-c4-fibonacci-difference-forest разности фибоначчи и лес, imo shortlist 2020 c4 imo imo shortlist 2020 trees graph_in_solution goal_exact_bound imo-2020-c4-fibonacci-difference-forest raznosti fibonachchi i les, imo shortlist 2020 c4 imo imo shortlist 2020 trees graph_in_solution goal_exact_bound"}
{"id":"imo-2020-c6-colored-coins-eulerian-multigraph","title":"Цветные монеты и эйлеровы циклы в мультиграфе, IMO Shortlist 2020 C6","path":"data\\problems\\imo\\imo-2020-c6-colored-coins-eulerian-multigraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2020-c6-colored-coins-eulerian-multigraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2020-c6-colored-coins-eulerian-multigraph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2020","tags":["eulerian_graphs","matching","coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2020-c6-colored-coins-eulerian-multigraph цветные монеты и эйлеровы циклы в мультиграфе, imo shortlist 2020 c6 imo imo shortlist 2020 eulerian_graphs matching coloring goal_proof milan haiman carl schildkraut imo-2020-c6-colored-coins-eulerian-multigraph tsvetnye monety i eylerovy tsikly v multigrafe, imo shortlist 2020 c6 imo imo shortlist 2020 eulerian_graphs matching coloring goal_proof milan haiman carl schildkraut"}
{"id":"imo-2021-c4-anisotropy-menger","title":"Королевство Анизотропии и непересекающиеся пути, IMO Shortlist 2021 C4","path":"data\\problems\\imo\\imo-2021-c4-anisotropy-menger.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2021-c4-anisotropy-menger.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2021-c4-anisotropy-menger","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2021","tags":["tournaments","connectivity","graph_cut","cut_counting","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2021-c4-anisotropy-menger королевство анизотропии и непересекающиеся пути, imo shortlist 2021 c4 imo imo shortlist 2021 tournaments connectivity graph_cut cut_counting goal_characterization warut suksompong imo-2021-c4-anisotropy-menger korolevstvo anizotropii i neperesekayuschiesya puti, imo shortlist 2021 c4 imo imo shortlist 2021 tournaments connectivity graph_cut cut_counting goal_characterization warut suksompong"}
{"id":"imo-2021-c6-functional-graph-roots","title":"Итерации полинома с ровно половинящимися образами, IMO Shortlist 2021 N8","path":"data\\problems\\imo\\imo-2021-c6-functional-graph-roots.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2021-c6-functional-graph-roots.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2021-c6-functional-graph-roots","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2021","tags":["dynamics","graph_in_solution","minimal_counterexample","construction","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2021-c6-functional-graph-roots итерации полинома с ровно половинящимися образами, imo shortlist 2021 n8 imo imo shortlist 2021 dynamics graph_in_solution minimal_counterexample construction goal_classification carl schildkraut imo-2021-c6-functional-graph-roots iteratsii polinoma s rovno polovinyaschimisya obrazami, imo shortlist 2021 n8 imo imo shortlist 2021 dynamics graph_in_solution minimal_counterexample construction goal_classification carl schildkraut"}
{"id":"imo-2023-c4-strip-pieces-eulerian-graph","title":"Разрезание полоски и эйлеров граф, IMO Shortlist 2023 C4","path":"data\\problems\\imo\\imo-2023-c4-strip-pieces-eulerian-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2023-c4-strip-pieces-eulerian-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2023-c4-strip-pieces-eulerian-graph","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2023","tags":["eulerian_graphs","connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2023-c4-strip-pieces-eulerian-graph разрезание полоски и эйлеров граф, imo shortlist 2023 c4 imo imo shortlist 2023 eulerian_graphs connectivity goal_exact_bound imo-2023-c4-strip-pieces-eulerian-graph razrezanie poloski i eylerov graf, imo shortlist 2023 c4 imo imo shortlist 2023 eulerian_graphs connectivity goal_exact_bound"}
{"id":"imo-2023-c7-ferry-companies-hamiltonian-paths","title":"Паромные компании и гамильтоновы пути, IMO Shortlist 2023 C7","path":"data\\problems\\imo\\imo-2023-c7-ferry-companies-hamiltonian-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2023-c7-ferry-companies-hamiltonian-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2023-c7-ferry-companies-hamiltonian-paths","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2023","tags":["coloring","hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2023-c7-ferry-companies-hamiltonian-paths паромные компании и гамильтоновы пути, imo shortlist 2023 c7 imo imo shortlist 2023 coloring hamiltonian_cycles goal_exact_bound imo-2023-c7-ferry-companies-hamiltonian-paths paromnye kompanii i gamiltonovy puti, imo shortlist 2023 c7 imo imo shortlist 2023 coloring hamiltonian_cycles goal_exact_bound"}
{"id":"imo-2024-c3-knights-chord-uncrossing","title":"Рыцари за круглым столом и соседние обмены, IMO Shortlist 2024 C3","path":"data\\problems\\imo\\imo-2024-c3-knights-chord-uncrossing.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2024-c3-knights-chord-uncrossing.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2024-c3-knights-chord-uncrossing","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2024","tags":["matching","extremal_choice","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2024-c3-knights-chord-uncrossing рыцари за круглым столом и соседние обмены, imo shortlist 2024 c3 imo imo shortlist 2024 matching extremal_choice induction goal_exact_bound imo-2024-c3-knights-chord-uncrossing rytsari za kruglym stolom i sosednie obmeny, imo shortlist 2024 c3 imo imo shortlist 2024 matching extremal_choice induction goal_exact_bound"}
{"id":"imo-2024-c4-turbo-grid-monsters-three-attempts-strategy","title":"Три попытки Турбо-улитки достаточны, IMO 2024 P5 / Shortlist C4","path":"data\\problems\\imo\\imo-2024-c4-turbo-grid-monsters-three-attempts-strategy.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2024-c4-turbo-grid-monsters-three-attempts-strategy.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2024-c4-turbo-grid-monsters-three-attempts-strategy","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"2024","tags":["connectivity","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2024-c4-turbo-grid-monsters-three-attempts-strategy три попытки турбо-улитки достаточны, imo 2024 p5 / shortlist c4 imo imo 2024 connectivity goal_strategy_game imo-2024-c4-turbo-grid-monsters-three-attempts-strategy tri popytki turbo-ulitki dostatochny, imo 2024 p5 / shortlist c4 imo imo 2024 connectivity goal_strategy_game"}
{"id":"imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound","title":"Две попытки Турбо-улитки недостаточны, IMO 2024 P5 / Shortlist C4","path":"data\\problems\\imo\\imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound","source_key":"imo","source_keys":["imo"],"source_label":"IMO","year":"2024","tags":["connectivity","goal_strategy_game","goal_bound"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound две попытки турбо-улитки недостаточны, imo 2024 p5 / shortlist c4 imo imo 2024 connectivity goal_strategy_game goal_bound imo-2024-c4-turbo-grid-monsters-two-attempts-lower-bound dve popytki turbo-ulitki nedostatochny, imo 2024 p5 / shortlist c4 imo imo 2024 connectivity goal_strategy_game goal_bound"}
{"id":"imo-2024-c8-board-coloring-tree","title":"Закрашивание доски операциями 2x2 и дерево, IMO Shortlist 2024 C8","path":"data\\problems\\imo\\imo-2024-c8-board-coloring-tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/imo/imo-2024-c8-board-coloring-tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#imo-2024-c8-board-coloring-tree","source_key":"imo","source_keys":["imo"],"source_label":"IMO Shortlist","year":"2024","tags":["trees","induction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"imo-2024-c8-board-coloring-tree закрашивание доски операциями 2x2 и дерево, imo shortlist 2024 c8 imo imo shortlist 2024 trees induction goal_characterization imo-2024-c8-board-coloring-tree zakrashivanie doski operatsiyami 2x2 i derevo, imo shortlist 2024 c8 imo imo shortlist 2024 trees induction goal_characterization"}
{"id":"inmo-2021-p4-detective-cards-hamiltonian-path","title":"Детектив, карты и гамильтонов путь после удаления рёбер, INMO 2021 P4","path":"data\\problems\\inmo\\inmo-2021-p4-detective-cards-hamiltonian-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/inmo/inmo-2021-p4-detective-cards-hamiltonian-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#inmo-2021-p4-detective-cards-hamiltonian-path","source_key":"inmo","source_keys":["inmo"],"source_label":"INMO","year":"2021","tags":["hamiltonian_cycles","connectivity","extremal_graph_theory","goal_exact_bound","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"inmo-2021-p4-detective-cards-hamiltonian-path детектив, карты и гамильтонов путь после удаления рёбер, inmo 2021 p4 inmo inmo 2021 hamiltonian_cycles connectivity extremal_graph_theory goal_exact_bound goal_strategy_game inmo-2021-p4-detective-cards-hamiltonian-path detektiv, karty i gamiltonov put posle udaleniya reber, inmo 2021 p4 inmo inmo 2021 hamiltonian_cycles connectivity extremal_graph_theory goal_exact_bound goal_strategy_game"}
{"id":"inmo-2023-p1-square-products-components","title":"Квадратные произведения и компоненты-клики, INMO 2023 P1","path":"data\\problems\\inmo\\inmo-2023-p1-square-products-components.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/inmo/inmo-2023-p1-square-products-components.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#inmo-2023-p1-square-products-components","source_key":"inmo","source_keys":["inmo"],"source_label":"INMO","year":"2023","tags":["connectivity","graph_model","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"inmo-2023-p1-square-products-components квадратные произведения и компоненты-клики, inmo 2023 p1 inmo inmo 2023 connectivity graph_model double_counting goal_existence inmo-2023-p1-square-products-components kvadratnye proizvedeniya i komponenty-kliki, inmo 2023 p1 inmo inmo 2023 connectivity graph_model double_counting goal_existence"}
{"id":"jbmo-2026-p3-three-color-lamps-cycle","title":"Максимум зелёных ламп при трёхцветной динамике на цикле, JBMO 2026 P3","path":"data\\problems\\jbmo\\jbmo-2026-p3-three-color-lamps-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/jbmo/jbmo-2026-p3-three-color-lamps-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#jbmo-2026-p3-three-color-lamps-cycle","source_key":"jbmo","source_keys":["jbmo"],"source_label":"JBMO","year":"2026","tags":["coloring","modular_coloring","dynamics","invariant","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"jbmo-2026-p3-three-color-lamps-cycle максимум зелёных ламп при трёхцветной динамике на цикле, jbmo 2026 p3 jbmo jbmo 2026 coloring modular_coloring dynamics invariant goal_exact_bound jbmo-2026-p3-three-color-lamps-cycle maksimum zelenyh lamp pri trehtsvetnoy dinamike na tsikle, jbmo 2026 p3 jbmo jbmo 2026 coloring modular_coloring dynamics invariant goal_exact_bound"}
{"id":"kolmogorov-2002-individual-olympiad-10-11-output-problem-5","title":"Разноцветный треугольник в полном графе при редких цветах, Кубок Колмогорова 2002","path":"data\\problems\\kolmogorov\\kolmogorov-2002-individual-olympiad-10-11-output-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2002-individual-olympiad-10-11-output-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2002-individual-olympiad-10-11-output-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2002","tags":["goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2002-individual-olympiad-10-11-output-problem-5 разноцветный треугольник в полном графе при редких цветах, кубок колмогорова 2002 kolmogorov кубок колмогорова 2002 goal_counting kolmogorov-2002-individual-olympiad-10-11-output-problem-5 raznotsvetnyy treugolnik v polnom grafe pri redkih tsvetah, kubok kolmogorova 2002 kolmogorov kubok kolmogorova 2002 goal_counting"}
{"id":"kolmogorov-2002-individual-olympiad-8-9-output-problem-5","title":"Разноцветный треугольник в полном графе при не менее n цветах, Кубок Колмогорова 2002","path":"data\\problems\\kolmogorov\\kolmogorov-2002-individual-olympiad-8-9-output-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2002-individual-olympiad-8-9-output-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2002-individual-olympiad-8-9-output-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2002","tags":["goal_counting","coloring"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2002-individual-olympiad-8-9-output-problem-5 разноцветный треугольник в полном графе при не менее n цветах, кубок колмогорова 2002 kolmogorov кубок колмогорова 2002 goal_counting coloring kolmogorov-2002-individual-olympiad-8-9-output-problem-5 raznotsvetnyy treugolnik v polnom grafe pri ne menee n tsvetah, kubok kolmogorova 2002 kolmogorov kubok kolmogorova 2002 goal_counting coloring"}
{"id":"kolmogorov-2002-team-olympiad-seniors-problem-8","title":"Пересечение n-клик при ограничениях на степени и независимые пары, Кубок Колмогорова 2002","path":"data\\problems\\kolmogorov\\kolmogorov-2002-team-olympiad-seniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2002-team-olympiad-seniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2002-team-olympiad-seniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2002","tags":["extremal_graph_theory","matching","forbidden_clique","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2002-team-olympiad-seniors-problem-8 пересечение n-клик при ограничениях на степени и независимые пары, кубок колмогорова 2002 kolmogorov кубок колмогорова 2002 extremal_graph_theory matching forbidden_clique goal_proof берлов с.л. kolmogorov-2002-team-olympiad-seniors-problem-8 peresechenie n-klik pri ogranicheniyah na stepeni i nezavisimye pary, kubok kolmogorova 2002 kolmogorov kubok kolmogorova 2002 extremal_graph_theory matching forbidden_clique goal_proof berlov s.l."}
{"id":"kolmogorov-2003-team-olympiad-seniors-problem-8","title":"Минимально сильно связный орграф на 100 городах, Кубок Колмогорова 2003","path":"data\\problems\\kolmogorov\\kolmogorov-2003-team-olympiad-seniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2003-team-olympiad-seniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2003-team-olympiad-seniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2003","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2003-team-olympiad-seniors-problem-8 минимально сильно связный орграф на 100 городах, кубок колмогорова 2003 kolmogorov кубок колмогорова 2003 connectivity extremal_graph_theory goal_exact_bound kolmogorov-2003-team-olympiad-seniors-problem-8 minimalno silno svyaznyy orgraf na 100 gorodah, kubok kolmogorova 2003 kolmogorov kubok kolmogorova 2003 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"kolmogorov-2004-round1-higher-league-problem-3","title":"Восстановление дерева без вершин степени 2 по удалениям вершин, Кубок Колмогорова 2004","path":"data\\problems\\kolmogorov\\kolmogorov-2004-round1-higher-league-problem-3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2004-round1-higher-league-problem-3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2004-round1-higher-league-problem-3","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2004","tags":["trees","connectivity","extremal_choice","degree_counting","goal_algorithm"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2004-round1-higher-league-problem-3 восстановление дерева без вершин степени 2 по удалениям вершин, кубок колмогорова 2004 kolmogorov кубок колмогорова 2004 trees connectivity extremal_choice degree_counting goal_algorithm kolmogorov-2004-round1-higher-league-problem-3 vosstanovlenie dereva bez vershin stepeni 2 po udaleniyam vershin, kubok kolmogorova 2004 kolmogorov kubok kolmogorova 2004 trees connectivity extremal_choice degree_counting goal_algorithm"}
{"id":"kolmogorov-2004-round2-higher-league-problem-9","title":"C4-свободный граф и арифметическая прогрессия из пяти независимых вершин, Кубок Колмогорова 2004","path":"data\\problems\\kolmogorov\\kolmogorov-2004-round2-higher-league-problem-9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2004-round2-higher-league-problem-9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2004-round2-higher-league-problem-9","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2004","tags":["extremal_graph_theory","double_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2004-round2-higher-league-problem-9 c4-свободный граф и арифметическая прогрессия из пяти независимых вершин, кубок колмогорова 2004 kolmogorov кубок колмогорова 2004 extremal_graph_theory double_counting goal_proof kolmogorov-2004-round2-higher-league-problem-9 c4-svobodnyy graf i arifmeticheskaya progressiya iz pyati nezavisimyh vershin, kubok kolmogorova 2004 kolmogorov kubok kolmogorova 2004 extremal_graph_theory double_counting goal_proof"}
{"id":"kolmogorov-2004-round3-higher-league-problem-10","title":"Удаление вершины с сохранением сильной связности орграфа, Кубок Колмогорова 2004","path":"data\\problems\\kolmogorov\\kolmogorov-2004-round3-higher-league-problem-10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2004-round3-higher-league-problem-10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2004-round3-higher-league-problem-10","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2004","tags":["connectivity","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2004-round3-higher-league-problem-10 удаление вершины с сохранением сильной связности орграфа, кубок колмогорова 2004 kolmogorov кубок колмогорова 2004 connectivity goal_proof карпов д.в. kolmogorov-2004-round3-higher-league-problem-10 udalenie vershiny s sohraneniem silnoy svyaznosti orgrafa, kubok kolmogorova 2004 kolmogorov kubok kolmogorova 2004 connectivity goal_proof karpov d.v."}
{"id":"kolmogorov-2004-round4-first-junior-league-problem-10","title":"Цикл в графе трехзначных простых чисел без цифры 1, Кубок Колмогорова 2004","path":"data\\problems\\kolmogorov\\kolmogorov-2004-round4-first-junior-league-problem-10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2004-round4-first-junior-league-problem-10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2004-round4-first-junior-league-problem-10","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2004","tags":["goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2004-round4-first-junior-league-problem-10 цикл в графе трехзначных простых чисел без цифры 1, кубок колмогорова 2004 kolmogorov кубок колмогорова 2004 goal_construction kolmogorov-2004-round4-first-junior-league-problem-10 tsikl v grafe trehznachnyh prostyh chisel bez tsifry 1, kubok kolmogorova 2004 kolmogorov kubok kolmogorova 2004 goal_construction"}
{"id":"kolmogorov-2004-team-olympiad-seniors-problem-9","title":"Важные рёбра для числа независимости и нечётный цикл, Кубок Колмогорова 2004","path":"data\\problems\\kolmogorov\\kolmogorov-2004-team-olympiad-seniors-problem-9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2004-team-olympiad-seniors-problem-9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2004-team-olympiad-seniors-problem-9","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2004","tags":["matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2004-team-olympiad-seniors-problem-9 важные рёбра для числа независимости и нечётный цикл, кубок колмогорова 2004 kolmogorov кубок колмогорова 2004 matching goal_proof kolmogorov-2004-team-olympiad-seniors-problem-9 vazhnye rebra dlya chisla nezavisimosti i nechetnyy tsikl, kubok kolmogorova 2004 kolmogorov kubok kolmogorova 2004 matching goal_proof"}
{"id":"kolmogorov-2005-team-olympiad-juniors-problem-8","title":"Чётность числа остовных деревьев в графе с чётными степенями, Кубок Колмогорова 2005","path":"data\\problems\\kolmogorov\\kolmogorov-2005-team-olympiad-juniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2005-team-olympiad-juniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2005-team-olympiad-juniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2005","tags":["double_counting","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2005-team-olympiad-juniors-problem-8 чётность числа остовных деревьев в графе с чётными степенями, кубок колмогорова 2005 kolmogorov кубок колмогорова 2005 double_counting trees goal_proof kolmogorov-2005-team-olympiad-juniors-problem-8 chetnost chisla ostovnyh derevev v grafe s chetnymi stepenyami, kubok kolmogorova 2005 kolmogorov kubok kolmogorova 2005 double_counting trees goal_proof"}
{"id":"kolmogorov-2005-team-olympiad-seniors-problem-9","title":"Чётность числа остовных деревьев в двудольном графе, Кубок Колмогорова 2005","path":"data\\problems\\kolmogorov\\kolmogorov-2005-team-olympiad-seniors-problem-9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2005-team-olympiad-seniors-problem-9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2005-team-olympiad-seniors-problem-9","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2005","tags":["double_counting","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2005-team-olympiad-seniors-problem-9 чётность числа остовных деревьев в двудольном графе, кубок колмогорова 2005 kolmogorov кубок колмогорова 2005 double_counting trees goal_proof kolmogorov-2005-team-olympiad-seniors-problem-9 chetnost chisla ostovnyh derevev v dvudolnom grafe, kubok kolmogorova 2005 kolmogorov kubok kolmogorova 2005 double_counting trees goal_proof"}
{"id":"kolmogorov-2006-round-1-super-high-first-league-problem-1","title":"Треугольник-свободный граф на 100 вершинах с большой минимальной степенью, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-1-super-high-first-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-1-super-high-first-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-1-super-high-first-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["coloring","extremal_graph_theory","forbidden_triangle","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2006-round-1-super-high-first-league-problem-1 треугольник-свободный граф на 100 вершинах с большой минимальной степенью, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 coloring extremal_graph_theory forbidden_triangle goal_proof kolmogorov-2006-round-1-super-high-first-league-problem-1 treugolnik-svobodnyy graf na 100 vershinah s bolshoy minimalnoy stepenyu, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 coloring extremal_graph_theory forbidden_triangle goal_proof"}
{"id":"kolmogorov-2006-round-1-super-high-first-league-problem-9","title":"Плоское разбиение квадрата и вершина малой степени, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-1-super-high-first-league-problem-9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-1-super-high-first-league-problem-9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-1-super-high-first-league-problem-9","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["double_counting","planar_graphs","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2006-round-1-super-high-first-league-problem-9 плоское разбиение квадрата и вершина малой степени, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 double_counting planar_graphs goal_counting kolmogorov-2006-round-1-super-high-first-league-problem-9 ploskoe razbienie kvadrata i vershina maloy stepeni, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 double_counting planar_graphs goal_counting"}
{"id":"kolmogorov-2006-round-2-first-junior-league-problem-8","title":"Максимум белых клеток в связной клетчатой фигуре с n чёрными, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-2-first-junior-league-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-2-first-junior-league-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-2-first-junior-league-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["matching","trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2006-round-2-first-junior-league-problem-8 максимум белых клеток в связной клетчатой фигуре с n чёрными, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 matching trees goal_exact_bound kolmogorov-2006-round-2-first-junior-league-problem-8 maksimum belyh kletok v svyaznoy kletchatoy figure s n chernymi, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 matching trees goal_exact_bound"}
{"id":"kolmogorov-2006-round-2-super-league-problem-6","title":"Разрезание клетчатой фигуры с втрое большим числом чёрных клеток, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-2-super-league-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-2-super-league-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-2-super-league-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["induction","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2006-round-2-super-league-problem-6 разрезание клетчатой фигуры с втрое большим числом чёрных клеток, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 induction trees goal_proof kolmogorov-2006-round-2-super-league-problem-6 razrezanie kletchatoy figury s vtroe bolshim chislom chernyh kletok, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 induction trees goal_proof"}
{"id":"kolmogorov-2006-round-3-super-league-problem-3","title":"1000-раскраска регулярного графа с разноцветными соседями заданной вершины, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-3-super-league-problem-3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-3-super-league-problem-3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-3-super-league-problem-3","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["coloring","connectivity","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2006-round-3-super-league-problem-3 1000-раскраска регулярного графа с разноцветными соседями заданной вершины, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 coloring connectivity goal_proof kolmogorov-2006-round-3-super-league-problem-3 1000-raskraska regulyarnogo grafa s raznotsvetnymi sosedyami zadannoy vershiny, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 coloring connectivity goal_proof"}
{"id":"kolmogorov-2006-round-4-super-league-problem-5","title":"Максимум различных треугольников в триангуляции n-угольника, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-round-4-super-league-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-round-4-super-league-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-round-4-super-league-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["double_counting","planar_graphs","trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2006-round-4-super-league-problem-5 максимум различных треугольников в триангуляции n-угольника, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 double_counting planar_graphs trees goal_counting kolmogorov-2006-round-4-super-league-problem-5 maksimum razlichnyh treugolnikov v triangulyatsii n-ugolnika, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 double_counting planar_graphs trees goal_counting"}
{"id":"kolmogorov-2006-team-olympiad-seniors-problem-9","title":"Подсчёт остовных деревьев в графе-колесе, Кубок Колмогорова 2006","path":"data\\problems\\kolmogorov\\kolmogorov-2006-team-olympiad-seniors-problem-9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2006-team-olympiad-seniors-problem-9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2006-team-olympiad-seniors-problem-9","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2006","tags":["double_counting","trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2006-team-olympiad-seniors-problem-9 подсчёт остовных деревьев в графе-колесе, кубок колмогорова 2006 kolmogorov кубок колмогорова 2006 double_counting trees goal_counting kolmogorov-2006-team-olympiad-seniors-problem-9 podschet ostovnyh derevev v grafe-kolese, kubok kolmogorova 2006 kolmogorov kubok kolmogorova 2006 double_counting trees goal_counting"}
{"id":"kolmogorov-2007-round-1-high-league-problem-5","title":"Продление пути в эйлеровом графе от центрального города, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-round-1-high-league-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-round-1-high-league-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-round-1-high-league-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["degree_counting","eulerian_graphs","trees","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2007-round-1-high-league-problem-5 продление пути в эйлеровом графе от центрального города, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 degree_counting eulerian_graphs trees goal_characterization kolmogorov-2007-round-1-high-league-problem-5 prodlenie puti v eylerovom grafe ot tsentralnogo goroda, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 degree_counting eulerian_graphs trees goal_characterization"}
{"id":"kolmogorov-2007-round-2-first-league-problem-8","title":"Клетчатый прямоугольник и граф смежности одинаковых фигурок, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-round-2-first-league-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-round-2-first-league-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-round-2-first-league-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["planar_graphs","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2007-round-2-first-league-problem-8 клетчатый прямоугольник и граф смежности одинаковых фигурок, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 planar_graphs goal_impossibility kolmogorov-2007-round-2-first-league-problem-8 kletchatyy pryamougolnik i graf smezhnosti odinakovyh figurok, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 planar_graphs goal_impossibility"}
{"id":"kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem","title":"k-раскраска графа с цветами размера хотя бы два, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem k-раскраска графа с цветами размера хотя бы два, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 coloring goal_counting kolmogorov-2007-round-2-high-and-first-league-chromatic-number-problem k-raskraska grafa s tsvetami razmera hotya by dva, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 coloring goal_counting"}
{"id":"kolmogorov-2007-round-3-high-and-first-league-problem-3","title":"Единственное разбиение графа на 5 независимых множеств, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-round-3-high-and-first-league-problem-3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-round-3-high-and-first-league-problem-3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-round-3-high-and-first-league-problem-3","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["coloring","connectivity","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2007-round-3-high-and-first-league-problem-3 единственное разбиение графа на 5 независимых множеств, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 coloring connectivity double_counting goal_counting kolmogorov-2007-round-3-high-and-first-league-problem-3 edinstvennoe razbienie grafa na 5 nezavisimyh mnozhestv, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 coloring connectivity double_counting goal_counting"}
{"id":"kolmogorov-2007-round-4-first-league-problem-1","title":"Нечётный ориентированный цикл в сильной ориентации графа, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-round-4-first-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-round-4-first-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-round-4-first-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["connectivity","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2007-round-4-first-league-problem-1 нечётный ориентированный цикл в сильной ориентации графа, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 connectivity goal_proof kolmogorov-2007-round-4-first-league-problem-1 nechetnyy orientirovannyy tsikl v silnoy orientatsii grafa, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 connectivity goal_proof"}
{"id":"kolmogorov-2007-team-olympiad-seniors-problem-7","title":"Пары знакомств при одинаковом числе рёбер в любом m-подмножестве, Кубок Колмогорова 2007","path":"data\\problems\\kolmogorov\\kolmogorov-2007-team-olympiad-seniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2007-team-olympiad-seniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2007-team-olympiad-seniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2007","tags":["double_counting","degree_counting","extremal_graph_theory","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2007-team-olympiad-seniors-problem-7 пары знакомств при одинаковом числе рёбер в любом m-подмножестве, кубок колмогорова 2007 kolmogorov кубок колмогорова 2007 double_counting degree_counting extremal_graph_theory goal_counting kolmogorov-2007-team-olympiad-seniors-problem-7 pary znakomstv pri odinakovom chisle reber v lyubom m-podmnozhestve, kubok kolmogorova 2007 kolmogorov kubok kolmogorova 2007 double_counting degree_counting extremal_graph_theory goal_counting"}
{"id":"kolmogorov-2008-individual-olympiad-juniors-problem-8","title":"Разделение рёбер 3-регулярного графа на две двудольные сети, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-individual-olympiad-juniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-individual-olympiad-juniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-individual-olympiad-juniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","matching","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-individual-olympiad-juniors-problem-8 разделение рёбер 3-регулярного графа на две двудольные сети, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring matching goal_construction kolmogorov-2008-individual-olympiad-juniors-problem-8 razdelenie reber 3-regulyarnogo grafa na dve dvudolnye seti, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring matching goal_construction"}
{"id":"kolmogorov-2008-individual-olympiad-seniors-problem-5","title":"Раскраска рёбер графа максимальной степени 1000 в 10 двудольных цветов, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-individual-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-individual-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-individual-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-individual-olympiad-seniors-problem-5 раскраска рёбер графа максимальной степени 1000 в 10 двудольных цветов, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring matching goal_proof kolmogorov-2008-individual-olympiad-seniors-problem-5 raskraska reber grafa maksimalnoy stepeni 1000 v 10 dvudolnyh tsvetov, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring matching goal_proof"}
{"id":"kolmogorov-2008-individual-olympiad-seniors-problem-7","title":"Гамильтонов цикл по рёбрам выпуклого многогранника, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-individual-olympiad-seniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-individual-olympiad-seniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-individual-olympiad-seniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["hamiltonian_cycles","planar_graphs","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-individual-olympiad-seniors-problem-7 гамильтонов цикл по рёбрам выпуклого многогранника, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 hamiltonian_cycles planar_graphs double_counting goal_existence и. богданов kolmogorov-2008-individual-olympiad-seniors-problem-7 gamiltonov tsikl po rebram vypuklogo mnogogrannika, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 hamiltonian_cycles planar_graphs double_counting goal_existence i. bogdanov"}
{"id":"kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1","title":"Максимум перестановок листа для преобразования одного дерева в другое, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1 максимум перестановок листа для преобразования одного дерева в другое, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 trees goal_exact_bound kolmogorov-2008-round-1-first-league-and-higher-junior-problem-1 maksimum perestanovok lista dlya preobrazovaniya odnogo dereva v drugoe, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 trees goal_exact_bound"}
{"id":"kolmogorov-2008-round-1-high-league-problem-1","title":"Циклы без единственного общего ребра и вершина степени не больше 2, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-1-high-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-1-high-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-1-high-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["connectivity","extremal_choice","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-1-high-league-problem-1 циклы без единственного общего ребра и вершина степени не больше 2, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 connectivity extremal_choice goal_proof kolmogorov-2008-round-1-high-league-problem-1 tsikly bez edinstvennogo obschego rebra i vershina stepeni ne bolshe 2, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 connectivity extremal_choice goal_proof"}
{"id":"kolmogorov-2008-round-2-first-junior-league-problem-1","title":"Двухцветная раскраска рёбер колеса с двумя связными цветами, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-2-first-junior-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-2-first-junior-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-2-first-junior-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","connectivity","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-2-first-junior-league-problem-1 двухцветная раскраска рёбер колеса с двумя связными цветами, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring connectivity double_counting goal_counting kolmogorov-2008-round-2-first-junior-league-problem-1 dvuhtsvetnaya raskraska reber kolesa s dvumya svyaznymi tsvetami, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring connectivity double_counting goal_counting"}
{"id":"kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1","title":"Подсчёт двухцветных раскрасок колеса с двумя связными цветами, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","connectivity","double_counting","trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1 подсчёт двухцветных раскрасок колеса с двумя связными цветами, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring connectivity double_counting trees goal_counting kolmogorov-2008-round-2-first-league-and-higher-junior-problem-1 podschet dvuhtsvetnyh raskrasok kolesa s dvumya svyaznymi tsvetami, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring connectivity double_counting trees goal_counting"}
{"id":"kolmogorov-2008-round-2-high-league-problem-1","title":"Минимум сравнений для восстановления порядка турнира, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-2-high-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-2-high-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-2-high-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["double_counting","tournaments","goal_exact_bound"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-2-high-league-problem-1 минимум сравнений для восстановления порядка турнира, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 double_counting tournaments goal_exact_bound kolmogorov-2008-round-2-high-league-problem-1 minimum sravneniy dlya vosstanovleniya poryadka turnira, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 double_counting tournaments goal_exact_bound"}
{"id":"kolmogorov-2008-round-2-second-league-problem-2","title":"Двухцветные связные подграфы в колесе на 100 городах, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-2-second-league-problem-2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-2-second-league-problem-2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-2-second-league-problem-2","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","connectivity","double_counting","trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-2-second-league-problem-2 двухцветные связные подграфы в колесе на 100 городах, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring connectivity double_counting trees goal_counting kolmogorov-2008-round-2-second-league-problem-2 dvuhtsvetnye svyaznye podgrafy v kolese na 100 gorodah, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring connectivity double_counting trees goal_counting"}
{"id":"kolmogorov-2008-round-3-high-league-problem-1","title":"Минимум рёбер при гамильтоновом пути между любой парой вершин, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-3-high-league-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-3-high-league-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-3-high-league-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["extremal_graph_theory","hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-round-3-high-league-problem-1 минимум рёбер при гамильтоновом пути между любой парой вершин, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 extremal_graph_theory hamiltonian_cycles goal_exact_bound kolmogorov-2008-round-3-high-league-problem-1 minimum reber pri gamiltonovom puti mezhdu lyuboy paroy vershin, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 extremal_graph_theory hamiltonian_cycles goal_exact_bound"}
{"id":"kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1","title":"Красный лист в двухцветно раскрашенном дереве, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["trees","coloring","double_counting","degree_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1 красный лист в двухцветно раскрашенном дереве, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 trees coloring double_counting degree_counting goal_proof kolmogorov-2008-round-4-first-league-and-higher-junior-problem-1 krasnyy list v dvuhtsvetno raskrashennom dereve, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 trees coloring double_counting degree_counting goal_proof"}
{"id":"kolmogorov-2008-round-4-second-league-problem-7","title":"Красный лист в дереве дорог между двумя республиками, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-round-4-second-league-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-round-4-second-league-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-round-4-second-league-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["double_counting","matching","trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2008-round-4-second-league-problem-7 красный лист в дереве дорог между двумя республиками, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 double_counting matching trees goal_counting kolmogorov-2008-round-4-second-league-problem-7 krasnyy list v dereve dorog mezhdu dvumya respublikami, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 double_counting matching trees goal_counting"}
{"id":"kolmogorov-2008-team-olympiad-juniors-problem-5","title":"Трёхдольный 2-регулярный граф на 2008 вершинах, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-team-olympiad-juniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-team-olympiad-juniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-team-olympiad-juniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Трёхдольный 2-регулярный граф на","year":"2008","tags":["coloring","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2008-team-olympiad-juniors-problem-5 трёхдольный 2-регулярный граф на 2008 вершинах, кубок колмогорова 2008 kolmogorov трёхдольный 2-регулярный граф на 2008 coloring goal_bound kolmogorov-2008-team-olympiad-juniors-problem-5 trehdolnyy 2-regulyarnyy graf na 2008 vershinah, kubok kolmogorova 2008 kolmogorov trehdolnyy 2-regulyarnyy graf na 2008 coloring goal_bound"}
{"id":"kolmogorov-2008-team-olympiad-seniors-problem-7","title":"Одноцветный 4-цикл в четырёхцветной раскраске K21, Кубок Колмогорова 2008","path":"data\\problems\\kolmogorov\\kolmogorov-2008-team-olympiad-seniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2008-team-olympiad-seniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2008-team-olympiad-seniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2008","tags":["coloring","double_counting","ramsey_theory","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2008-team-olympiad-seniors-problem-7 одноцветный 4-цикл в четырёхцветной раскраске k21, кубок колмогорова 2008 kolmogorov кубок колмогорова 2008 coloring double_counting ramsey_theory goal_counting kolmogorov-2008-team-olympiad-seniors-problem-7 odnotsvetnyy 4-tsikl v chetyrehtsvetnoy raskraske k21, kubok kolmogorova 2008 kolmogorov kubok kolmogorova 2008 coloring double_counting ramsey_theory goal_counting"}
{"id":"kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic","title":"Плотный гамильтонов граф содержит циклы всех длин, Кубок Колмогорова 2009","path":"data\\problems\\kolmogorov\\kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2009","tags":["extremal_graph_theory","hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"external_theorem_application","search_text":"kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic плотный гамильтонов граф содержит циклы всех длин, кубок колмогорова 2009 kolmogorov кубок колмогорова 2009 extremal_graph_theory hamiltonian_cycles goal_exact_bound kolmogorov-2009-round1-high-dense-hamiltonian-pancyclic plotnyy gamiltonov graf soderzhit tsikly vseh dlin, kubok kolmogorova 2009 kolmogorov kubok kolmogorova 2009 extremal_graph_theory hamiltonian_cycles goal_exact_bound"}
{"id":"kolmogorov-2009-round2-high-local-vertex-cover-coloring","title":"Локальные вершинные покрытия дают оценку раскраски, Кубок Колмогорова 2009, первая лига","path":"data\\problems\\kolmogorov\\kolmogorov-2009-round2-high-local-vertex-cover-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2009-round2-high-local-vertex-cover-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2009-round2-high-local-vertex-cover-coloring","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2009","tags":["coloring","extremal_graph_theory","matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"conditional_corrected_statement_solution","search_text":"kolmogorov-2009-round2-high-local-vertex-cover-coloring локальные вершинные покрытия дают оценку раскраски, кубок колмогорова 2009, первая лига kolmogorov кубок колмогорова 2009 coloring extremal_graph_theory matching goal_proof дольников в.л. и. богданов kolmogorov-2009-round2-high-local-vertex-cover-coloring lokalnye vershinnye pokrytiya dayut otsenku raskraski, kubok kolmogorova 2009, pervaya liga kolmogorov kubok kolmogorova 2009 coloring extremal_graph_theory matching goal_proof dolnikov v.l. i. bogdanov"}
{"id":"kolmogorov-2009-round3-high-edge-label-three-edge-path","title":"Трёхрёберный путь малой суммы в полном графе с метками, Кубок Колмогорова 2009","path":"data\\problems\\kolmogorov\\kolmogorov-2009-round3-high-edge-label-three-edge-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2009-round3-high-edge-label-three-edge-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2009-round3-high-edge-label-three-edge-path","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2009","tags":["goal_bound","goal_existence","goal_proof"],"agent_topics":[],"solution_state":"without_solution","solution_classification_type":"no_solution_hard","search_text":"kolmogorov-2009-round3-high-edge-label-three-edge-path трёхрёберный путь малой суммы в полном графе с метками, кубок колмогорова 2009 kolmogorov кубок колмогорова 2009 goal_bound goal_existence goal_proof и. богданов г. челноков кноп к.а. kolmogorov-2009-round3-high-edge-label-three-edge-path trehrebernyy put maloy summy v polnom grafe s metkami, kubok kolmogorova 2009 kolmogorov kubok kolmogorova 2009 goal_bound goal_existence goal_proof i. bogdanov g. chelnokov knop k.a."}
{"id":"kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths","title":"Много гамильтоновых путей в регулярном турнире, Кубок Колмогорова 2009","path":"data\\problems\\kolmogorov\\kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2009","tags":["tournaments","hamiltonian_cycles","goal_counting","goal_bound","degree_counting","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths много гамильтоновых путей в регулярном турнире, кубок колмогорова 2009 kolmogorov кубок колмогорова 2009 tournaments hamiltonian_cycles goal_counting goal_bound degree_counting classical_theorem kolmogorov-2009-round4-high-regular-tournament-hamiltonian-paths mnogo gamiltonovyh putey v regulyarnom turnire, kubok kolmogorova 2009 kolmogorov kubok kolmogorova 2009 tournaments hamiltonian_cycles goal_counting goal_bound degree_counting classical_theorem"}
{"id":"kolmogorov-2010-individual-olympiad-juniors-problem-5","title":"Сохранение диаметра не больше 8 после удаления дороги, Кубок Колмогорова 2010","path":"data\\problems\\kolmogorov\\kolmogorov-2010-individual-olympiad-juniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2010-individual-olympiad-juniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2010-individual-olympiad-juniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2010","tags":["hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2010-individual-olympiad-juniors-problem-5 сохранение диаметра не больше 8 после удаления дороги, кубок колмогорова 2010 kolmogorov кубок колмогорова 2010 hamiltonian_cycles goal_exact_bound kolmogorov-2010-individual-olympiad-juniors-problem-5 sohranenie diametra ne bolshe 8 posle udaleniya dorogi, kubok kolmogorova 2010 kolmogorov kubok kolmogorova 2010 hamiltonian_cycles goal_exact_bound"}
{"id":"kolmogorov-2010-individual-olympiad-seniors-problem-4","title":"Турнир с общей столицей и разбиением на две республики, Кубок Колмогорова 2010","path":"data\\problems\\kolmogorov\\kolmogorov-2010-individual-olympiad-seniors-problem-4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2010-individual-olympiad-seniors-problem-4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2010-individual-olympiad-seniors-problem-4","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2010","tags":["double_counting","hamiltonian_cycles","tournaments","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete","search_text":"kolmogorov-2010-individual-olympiad-seniors-problem-4 турнир с общей столицей и разбиением на две республики, кубок колмогорова 2010 kolmogorov кубок колмогорова 2010 double_counting hamiltonian_cycles tournaments goal_counting kolmogorov-2010-individual-olympiad-seniors-problem-4 turnir s obschey stolitsey i razbieniem na dve respubliki, kubok kolmogorova 2010 kolmogorov kubok kolmogorova 2010 double_counting hamiltonian_cycles tournaments goal_counting"}
{"id":"kolmogorov-2011-individual-olympiad-seniors-problem-7","title":"Гамильтонов цикл в третьей степени связного графа, Кубок Колмогорова 2011","path":"data\\problems\\kolmogorov\\kolmogorov-2011-individual-olympiad-seniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2011-individual-olympiad-seniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2011-individual-olympiad-seniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2011","tags":["hamiltonian_cycles","induction","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2011-individual-olympiad-seniors-problem-7 гамильтонов цикл в третьей степени связного графа, кубок колмогорова 2011 kolmogorov кубок колмогорова 2011 hamiltonian_cycles induction trees goal_proof kolmogorov-2011-individual-olympiad-seniors-problem-7 gamiltonov tsikl v tretey stepeni svyaznogo grafa, kubok kolmogorova 2011 kolmogorov kubok kolmogorova 2011 hamiltonian_cycles induction trees goal_proof"}
{"id":"kolmogorov-2011-team-olympiad-juniors-problem-6","title":"Маршрут муравья по диагоналям клеток куба 15×15×15, Кубок Колмогорова 2011","path":"data\\problems\\kolmogorov\\kolmogorov-2011-team-olympiad-juniors-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2011-team-olympiad-juniors-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2011-team-olympiad-juniors-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2011","tags":["connectivity","eulerian_graphs","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2011-team-olympiad-juniors-problem-6 маршрут муравья по диагоналям клеток куба 15×15×15, кубок колмогорова 2011 kolmogorov кубок колмогорова 2011 connectivity eulerian_graphs goal_exact_bound kolmogorov-2011-team-olympiad-juniors-problem-6 marshrut muravya po diagonalyam kletok kuba 15×15×15, kubok kolmogorova 2011 kolmogorov kubok kolmogorova 2011 connectivity eulerian_graphs goal_exact_bound"}
{"id":"kolmogorov-2011-team-olympiad-seniors-problem-4","title":"Маршрут муравья по диагоналям клеток куба 11×11×11, Кубок Колмогорова 2011","path":"data\\problems\\kolmogorov\\kolmogorov-2011-team-olympiad-seniors-problem-4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2011-team-olympiad-seniors-problem-4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2011-team-olympiad-seniors-problem-4","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2011","tags":["connectivity","eulerian_graphs","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2011-team-olympiad-seniors-problem-4 маршрут муравья по диагоналям клеток куба 11×11×11, кубок колмогорова 2011 kolmogorov кубок колмогорова 2011 connectivity eulerian_graphs goal_counting kolmogorov-2011-team-olympiad-seniors-problem-4 marshrut muravya po diagonalyam kletok kuba 11×11×11, kubok kolmogorova 2011 kolmogorov kubok kolmogorova 2011 connectivity eulerian_graphs goal_counting"}
{"id":"kolmogorov-2012-individual-olympiad-seniors-problem-1","title":"Минимум рёбер в графе, где добавление любого ребра создаёт треугольник, Кубок Колмогорова 2012","path":"data\\problems\\kolmogorov\\kolmogorov-2012-individual-olympiad-seniors-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2012-individual-olympiad-seniors-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2012-individual-olympiad-seniors-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2012","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2012-individual-olympiad-seniors-problem-1 минимум рёбер в графе, где добавление любого ребра создаёт треугольник, кубок колмогорова 2012 kolmogorov кубок колмогорова 2012 connectivity extremal_graph_theory goal_exact_bound kolmogorov-2012-individual-olympiad-seniors-problem-1 minimum reber v grafe, gde dobavlenie lyubogo rebra sozdaet treugolnik, kubok kolmogorova 2012 kolmogorov kubok kolmogorova 2012 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"kolmogorov-2012-individual-olympiad-seniors-problem-6","title":"Маршрут по сетке Сугробска с посещением всех узлов улиц, Кубок Колмогорова 2012","path":"data\\problems\\kolmogorov\\kolmogorov-2012-individual-olympiad-seniors-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2012-individual-olympiad-seniors-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2012-individual-olympiad-seniors-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2012","tags":["double_counting","eulerian_graphs","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2012-individual-olympiad-seniors-problem-6 маршрут по сетке сугробска с посещением всех узлов улиц, кубок колмогорова 2012 kolmogorov кубок колмогорова 2012 double_counting eulerian_graphs goal_exact_bound kolmogorov-2012-individual-olympiad-seniors-problem-6 marshrut po setke sugrobska s posescheniem vseh uzlov ulits, kubok kolmogorova 2012 kolmogorov kubok kolmogorova 2012 double_counting eulerian_graphs goal_exact_bound"}
{"id":"kolmogorov-2013-individual-olympiad-seniors-problem-5","title":"Цикл через листья дерева и гамильтонов цикл после добавления рёбер, Кубок Колмогорова 2013","path":"data\\problems\\kolmogorov\\kolmogorov-2013-individual-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2013-individual-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2013-individual-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2013","tags":["coloring","trees","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2013-individual-olympiad-seniors-problem-5 цикл через листья дерева и гамильтонов цикл после добавления рёбер, кубок колмогорова 2013 kolmogorov кубок колмогорова 2013 coloring trees induction goal_proof kolmogorov-2013-individual-olympiad-seniors-problem-5 tsikl cherez listya dereva i gamiltonov tsikl posle dobavleniya reber, kubok kolmogorova 2013 kolmogorov kubok kolmogorova 2013 coloring trees induction goal_proof"}
{"id":"kolmogorov-2013-team-olympiad-juniors-problem-7","title":"Склейка k-раскрасок трёх частей графа, Кубок Колмогорова 2013","path":"data\\problems\\kolmogorov\\kolmogorov-2013-team-olympiad-juniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2013-team-olympiad-juniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2013-team-olympiad-juniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2013","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2013-team-olympiad-juniors-problem-7 склейка k-раскрасок трёх частей графа, кубок колмогорова 2013 kolmogorov кубок колмогорова 2013 coloring goal_counting kolmogorov-2013-team-olympiad-juniors-problem-7 skleyka k-raskrasok treh chastey grafa, kubok kolmogorova 2013 kolmogorov kubok kolmogorova 2013 coloring goal_counting"}
{"id":"kolmogorov-2013-team-olympiad-seniors-problem-8","title":"Склейка k-раскрасок трёх частей графа с несмежными A и C, Кубок Колмогорова 2013","path":"data\\problems\\kolmogorov\\kolmogorov-2013-team-olympiad-seniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2013-team-olympiad-seniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2013-team-olympiad-seniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2013","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2013-team-olympiad-seniors-problem-8 склейка k-раскрасок трёх частей графа с несмежными a и c, кубок колмогорова 2013 kolmogorov кубок колмогорова 2013 coloring goal_exact_bound kolmogorov-2013-team-olympiad-seniors-problem-8 skleyka k-raskrasok treh chastey grafa s nesmezhnymi a i c, kubok kolmogorova 2013 kolmogorov kubok kolmogorova 2013 coloring goal_exact_bound"}
{"id":"kolmogorov-2014-round1-complete-graph-orientation-game","title":"Игра в ориентацию рёбер полного графа, Кубок Колмогорова 2014","path":"data\\problems\\kolmogorov\\kolmogorov-2014-round1-complete-graph-orientation-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2014-round1-complete-graph-orientation-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2014-round1-complete-graph-orientation-game","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2014","tags":["tournaments","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2014-round1-complete-graph-orientation-game игра в ориентацию рёбер полного графа, кубок колмогорова 2014 kolmogorov кубок колмогорова 2014 tournaments goal_strategy_game kolmogorov-2014-round1-complete-graph-orientation-game igra v orientatsiyu reber polnogo grafa, kubok kolmogorova 2014 kolmogorov kubok kolmogorova 2014 tournaments goal_strategy_game"}
{"id":"kolmogorov-2014-round1-oriendiriya-road-orientation-game","title":"Игра ориентации рёбер полного графа, Кубок Колмогорова 2014","path":"data\\problems\\kolmogorov\\kolmogorov-2014-round1-oriendiriya-road-orientation-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2014-round1-oriendiriya-road-orientation-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2014-round1-oriendiriya-road-orientation-game","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2014","tags":["tournaments","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2014-round1-oriendiriya-road-orientation-game игра ориентации рёбер полного графа, кубок колмогорова 2014 kolmogorov кубок колмогорова 2014 tournaments goal_strategy_game жюри kolmogorov-2014-round1-oriendiriya-road-orientation-game igra orientatsii reber polnogo grafa, kubok kolmogorova 2014 kolmogorov kubok kolmogorova 2014 tournaments goal_strategy_game zhyuri"}
{"id":"kolmogorov-2014-round3-city-triangle-routes","title":"Граф дорог и треугольные маршруты, Кубок Колмогорова 2014","path":"data\\problems\\kolmogorov\\kolmogorov-2014-round3-city-triangle-routes.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2014-round3-city-triangle-routes.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2014-round3-city-triangle-routes","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2014","tags":["double_counting","goal_counting","matching"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2014-round3-city-triangle-routes граф дорог и треугольные маршруты, кубок колмогорова 2014 kolmogorov кубок колмогорова 2014 double_counting goal_counting matching карпов д.в. kolmogorov-2014-round3-city-triangle-routes graf dorog i treugolnye marshruty, kubok kolmogorova 2014 kolmogorov kubok kolmogorova 2014 double_counting goal_counting matching karpov d.v."}
{"id":"kolmogorov-2014-round3-four-regular-two-100-cycles","title":"Два непересекающихся 100-цикла в 4-регулярном графе, Кубок Колмогорова 2014","path":"data\\problems\\kolmogorov\\kolmogorov-2014-round3-four-regular-two-100-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2014-round3-four-regular-two-100-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2014-round3-four-regular-two-100-cycles","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2014","tags":["connectivity","goal_proof","construction","hamiltonian_cycles"],"agent_topics":[],"solution_state":"without_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"kolmogorov-2014-round3-four-regular-two-100-cycles два непересекающихся 100-цикла в 4-регулярном графе, кубок колмогорова 2014 kolmogorov кубок колмогорова 2014 connectivity goal_proof construction hamiltonian_cycles карпов д.в. kolmogorov-2014-round3-four-regular-two-100-cycles dva neperesekayuschihsya 100-tsikla v 4-regulyarnom grafe, kubok kolmogorova 2014 kolmogorov kubok kolmogorova 2014 connectivity goal_proof construction hamiltonian_cycles karpov d.v."}
{"id":"kolmogorov-2014-round4-diameter-cycle-length","title":"Условие на диаметр заставляет существовать длинный цикл, Кубок Колмогорова 2014","path":"data\\problems\\kolmogorov\\kolmogorov-2014-round4-diameter-cycle-length.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2014-round4-diameter-cycle-length.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2014-round4-diameter-cycle-length","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2014","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2014-round4-diameter-cycle-length условие на диаметр заставляет существовать длинный цикл, кубок колмогорова 2014 kolmogorov кубок колмогорова 2014 connectivity goal_exact_bound s. kozerenko t. huynh kolmogorov-2014-round4-diameter-cycle-length uslovie na diametr zastavlyaet suschestvovat dlinnyy tsikl, kubok kolmogorova 2014 kolmogorov kubok kolmogorova 2014 connectivity goal_exact_bound s. kozerenko t. huynh"}
{"id":"kolmogorov-2015-individual-olympiad-juniors-problem-7","title":"Раскраска пар на балу при степенях не меньше 2, Кубок Колмогорова 2015","path":"data\\problems\\kolmogorov\\kolmogorov-2015-individual-olympiad-juniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2015-individual-olympiad-juniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2015-individual-olympiad-juniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2015","tags":["coloring","graph_in_solution","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_repaired_complete","search_text":"kolmogorov-2015-individual-olympiad-juniors-problem-7 раскраска пар на балу при степенях не меньше 2, кубок колмогорова 2015 kolmogorov кубок колмогорова 2015 coloring graph_in_solution goal_existence kolmogorov-2015-individual-olympiad-juniors-problem-7 raskraska par na balu pri stepenyah ne menshe 2, kubok kolmogorova 2015 kolmogorov kubok kolmogorova 2015 coloring graph_in_solution goal_existence"}
{"id":"kolmogorov-2015-round-2-graph-coloring-problem","title":"Трёхцветная раскраска графа при ограничении на число циклов через ребро, Кубок Колмогорова 2015","path":"data\\problems\\kolmogorov\\kolmogorov-2015-round-2-graph-coloring-problem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2015-round-2-graph-coloring-problem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2015-round-2-graph-coloring-problem","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2015","tags":["coloring","connectivity","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2015-round-2-graph-coloring-problem трёхцветная раскраска графа при ограничении на число циклов через ребро, кубок колмогорова 2015 kolmogorov кубок колмогорова 2015 coloring connectivity induction goal_proof kolmogorov-2015-round-2-graph-coloring-problem trehtsvetnaya raskraska grafa pri ogranichenii na chislo tsiklov cherez rebro, kubok kolmogorova 2015 kolmogorov kubok kolmogorova 2015 coloring connectivity induction goal_proof"}
{"id":"kolmogorov-2015-round-3-missionaries-and-cannibals-problem","title":"Граф переправ миссионеров и каннибалов через реку, Кубок Колмогорова 2015","path":"data\\problems\\kolmogorov\\kolmogorov-2015-round-3-missionaries-and-cannibals-problem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2015-round-3-missionaries-and-cannibals-problem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2015-round-3-missionaries-and-cannibals-problem","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2015","tags":["goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2015-round-3-missionaries-and-cannibals-problem граф переправ миссионеров и каннибалов через реку, кубок колмогорова 2015 kolmogorov кубок колмогорова 2015 goal_impossibility kolmogorov-2015-round-3-missionaries-and-cannibals-problem graf pereprav missionerov i kannibalov cherez reku, kubok kolmogorova 2015 kolmogorov kubok kolmogorova 2015 goal_impossibility"}
{"id":"kolmogorov-2015-round-4-spies-and-opergroups-problem","title":"Граф связных индуцированных подграфов, Кубок Колмогорова 2015","path":"data\\problems\\kolmogorov\\kolmogorov-2015-round-4-spies-and-opergroups-problem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2015-round-4-spies-and-opergroups-problem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2015-round-4-spies-and-opergroups-problem","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2015","tags":["connectivity","induction","graph_model","goal_algorithm"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2015-round-4-spies-and-opergroups-problem граф связных индуцированных подграфов, кубок колмогорова 2015 kolmogorov кубок колмогорова 2015 connectivity induction graph_model goal_algorithm и. богданов kolmogorov-2015-round-4-spies-and-opergroups-problem graf svyaznyh indutsirovannyh podgrafov, kubok kolmogorova 2015 kolmogorov kubok kolmogorova 2015 connectivity induction graph_model goal_algorithm i. bogdanov"}
{"id":"kolmogorov-2016-individual-olympiad-juniors-problem-7","title":"Подмножество натуральных чисел без взаимной делимости и сдвинутой делимости, Кубок Колмогорова 2016","path":"data\\problems\\kolmogorov\\kolmogorov-2016-individual-olympiad-juniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2016-individual-olympiad-juniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2016-individual-olympiad-juniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2016","tags":["goal_existence","extremal_choice"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2016-individual-olympiad-juniors-problem-7 подмножество натуральных чисел без взаимной делимости и сдвинутой делимости, кубок колмогорова 2016 kolmogorov кубок колмогорова 2016 goal_existence extremal_choice kolmogorov-2016-individual-olympiad-juniors-problem-7 podmnozhestvo naturalnyh chisel bez vzaimnoy delimosti i sdvinutoy delimosti, kubok kolmogorova 2016 kolmogorov kubok kolmogorova 2016 goal_existence extremal_choice"}
{"id":"kolmogorov-2016-team-olympiad-juniors-problem-6","title":"Достижимость по разностям номеров в правильном 2017-угольнике, Кубок Колмогорова 2016, командная олимпиада, старшая группа","path":"data\\problems\\kolmogorov\\kolmogorov-2016-team-olympiad-juniors-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2016-team-olympiad-juniors-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2016-team-olympiad-juniors-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Достижимость по разностям номеров в правильном","year":"2016","tags":["goal_exact_bound","coloring","modular_coloring","pigeonhole_principle","potential_function","graph_in_solution"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2016-team-olympiad-juniors-problem-6 достижимость по разностям номеров в правильном 2017-угольнике, кубок колмогорова 2016, командная олимпиада, старшая группа kolmogorov достижимость по разностям номеров в правильном 2016 goal_exact_bound coloring modular_coloring pigeonhole_principle potential_function graph_in_solution а. антропов в. клепцын kolmogorov-2016-team-olympiad-juniors-problem-6 dostizhimost po raznostyam nomerov v pravilnom 2017-ugolnike, kubok kolmogorova 2016, komandnaya olimpiada, starshaya gruppa kolmogorov dostizhimost po raznostyam nomerov v pravilnom 2016 goal_exact_bound coloring modular_coloring pigeonhole_principle potential_function graph_in_solution a. antropov v. kleptsyn"}
{"id":"kolmogorov-2017-individual-olympiad-seniors-problem-7","title":"Покрытие вершин a-хорошими графами с ограниченной степенью, Кубок Колмогорова 2017","path":"data\\problems\\kolmogorov\\kolmogorov-2017-individual-olympiad-seniors-problem-7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2017-individual-olympiad-seniors-problem-7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2017-individual-olympiad-seniors-problem-7","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2017","tags":["coloring","extremal_choice","induction","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2017-individual-olympiad-seniors-problem-7 покрытие вершин a-хорошими графами с ограниченной степенью, кубок колмогорова 2017 kolmogorov кубок колмогорова 2017 coloring extremal_choice induction goal_bound kolmogorov-2017-individual-olympiad-seniors-problem-7 pokrytie vershin a-horoshimi grafami s ogranichennoy stepenyu, kubok kolmogorova 2017 kolmogorov kubok kolmogorova 2017 coloring extremal_choice induction goal_bound"}
{"id":"kolmogorov-2017-team-olympiad-juniors-problem-6","title":"Закрытые дороги, не меняющие кратчайшие стоимости в полном графе, Кубок Колмогорова 2017","path":"data\\problems\\kolmogorov\\kolmogorov-2017-team-olympiad-juniors-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2017-team-olympiad-juniors-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2017-team-olympiad-juniors-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2017","tags":["goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2017-team-olympiad-juniors-problem-6 закрытые дороги, не меняющие кратчайшие стоимости в полном графе, кубок колмогорова 2017 kolmogorov кубок колмогорова 2017 goal_exact_bound kolmogorov-2017-team-olympiad-juniors-problem-6 zakrytye dorogi, ne menyayuschie kratchayshie stoimosti v polnom grafe, kubok kolmogorova 2017 kolmogorov kubok kolmogorova 2017 goal_exact_bound"}
{"id":"kolmogorov-2017-team-olympiad-seniors-problem-5","title":"Дешёвые маршруты через не более двух дорог в связной сети авиарейсов, Кубок Колмогорова 2017","path":"data\\problems\\kolmogorov\\kolmogorov-2017-team-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2017-team-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2017-team-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2017","tags":["goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2017-team-olympiad-seniors-problem-5 дешёвые маршруты через не более двух дорог в связной сети авиарейсов, кубок колмогорова 2017 kolmogorov кубок колмогорова 2017 goal_bound kolmogorov-2017-team-olympiad-seniors-problem-5 deshevye marshruty cherez ne bolee dvuh dorog v svyaznoy seti aviareysov, kubok kolmogorova 2017 kolmogorov kubok kolmogorova 2017 goal_bound"}
{"id":"kolmogorov-2018-team-olympiad-juniors-problem-6","title":"Минимальная сумма автобусной и железнодорожной мобильностей, Кубок Колмогорова 2018","path":"data\\problems\\kolmogorov\\kolmogorov-2018-team-olympiad-juniors-problem-6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2018-team-olympiad-juniors-problem-6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2018-team-olympiad-juniors-problem-6","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2018","tags":["coloring","double_counting","graph_cut","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution_reconstructed","search_text":"kolmogorov-2018-team-olympiad-juniors-problem-6 минимальная сумма автобусной и железнодорожной мобильностей, кубок колмогорова 2018 kolmogorov кубок колмогорова 2018 coloring double_counting graph_cut goal_exact_bound kolmogorov-2018-team-olympiad-juniors-problem-6 minimalnaya summa avtobusnoy i zheleznodorozhnoy mobilnostey, kubok kolmogorova 2018 kolmogorov kubok kolmogorova 2018 coloring double_counting graph_cut goal_exact_bound"}
{"id":"kolmogorov-2018-team-olympiad-seniors-problem-5","title":"Минимальная сумма автобусной и железнодорожной мобильностей в 2018 городах, Кубок Колмогорова 2018","path":"data\\problems\\kolmogorov\\kolmogorov-2018-team-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2018-team-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2018-team-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Минимальная сумма автобусной и железнодорожной мобильностей в","year":"2018","tags":["coloring","double_counting","graph_cut","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution_reconstructed","search_text":"kolmogorov-2018-team-olympiad-seniors-problem-5 минимальная сумма автобусной и железнодорожной мобильностей в 2018 городах, кубок колмогорова 2018 kolmogorov минимальная сумма автобусной и железнодорожной мобильностей в 2018 coloring double_counting graph_cut goal_exact_bound kolmogorov-2018-team-olympiad-seniors-problem-5 minimalnaya summa avtobusnoy i zheleznodorozhnoy mobilnostey v 2018 gorodah, kubok kolmogorova 2018 kolmogorov minimalnaya summa avtobusnoy i zheleznodorozhnoy mobilnostey v 2018 coloring double_counting graph_cut goal_exact_bound"}
{"id":"kolmogorov-2019-team-olympiad-juniors-problem-8","title":"Два непересекающихся цикла в орграфе исходящей степени 3, Кубок Колмогорова 2019","path":"data\\problems\\kolmogorov\\kolmogorov-2019-team-olympiad-juniors-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2019-team-olympiad-juniors-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2019-team-olympiad-juniors-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2019","tags":["induction","minimal_counterexample","extremal_choice","degree_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2019-team-olympiad-juniors-problem-8 два непересекающихся цикла в орграфе исходящей степени 3, кубок колмогорова 2019 kolmogorov кубок колмогорова 2019 induction minimal_counterexample extremal_choice degree_counting goal_proof шортлист олимпиады \"балтийский путь\", 2019 kolmogorov-2019-team-olympiad-juniors-problem-8 dva neperesekayuschihsya tsikla v orgrafe ishodyaschey stepeni 3, kubok kolmogorova 2019 kolmogorov kubok kolmogorova 2019 induction minimal_counterexample extremal_choice degree_counting goal_proof shortlist olimpiady \"baltiyskiy put\", 2019"}
{"id":"kolmogorov-2021-individual-olympiad-seniors-problem-1","title":"Двухкруговой турнир с равным числом домашних и гостевых побед, Кубок Колмогорова 2021","path":"data\\problems\\kolmogorov\\kolmogorov-2021-individual-olympiad-seniors-problem-1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-individual-olympiad-seniors-problem-1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-individual-olympiad-seniors-problem-1","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["double_counting","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2021-individual-olympiad-seniors-problem-1 двухкруговой турнир с равным числом домашних и гостевых побед, кубок колмогорова 2021 kolmogorov кубок колмогорова 2021 double_counting goal_strategy_game kolmogorov-2021-individual-olympiad-seniors-problem-1 dvuhkrugovoy turnir s ravnym chislom domashnih i gostevyh pobed, kubok kolmogorova 2021 kolmogorov kubok kolmogorova 2021 double_counting goal_strategy_game"}
{"id":"kolmogorov-2021-individual-olympiad-seniors-problem-5","title":"Гаджеты и паросочетание по предпочтениям детей, Кубок Колмогорова 2021","path":"data\\problems\\kolmogorov\\kolmogorov-2021-individual-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-individual-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-individual-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["connectivity","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2021-individual-olympiad-seniors-problem-5 гаджеты и паросочетание по предпочтениям детей, кубок колмогорова 2021 kolmogorov кубок колмогорова 2021 connectivity goal_impossibility kolmogorov-2021-individual-olympiad-seniors-problem-5 gadzhety i parosochetanie po predpochteniyam detey, kubok kolmogorova 2021 kolmogorov kubok kolmogorova 2021 connectivity goal_impossibility"}
{"id":"kolmogorov-2021-komol-chip-firing-edge-discrepancy","title":"Фишки, выстрелы и соседнее ребро, Кубок Колмогорова 2021 КомОл seniors 8","path":"data\\problems\\kolmogorov\\kolmogorov-2021-komol-chip-firing-edge-discrepancy.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-komol-chip-firing-edge-discrepancy.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-komol-chip-firing-edge-discrepancy","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2021-komol-chip-firing-edge-discrepancy фишки, выстрелы и соседнее ребро, кубок колмогорова 2021 комол seniors 8 kolmogorov кубок колмогорова 2021 goal_exact_bound gábor tardos kolmogorov-2021-komol-chip-firing-edge-discrepancy fishki, vystrely i sosednee rebro, kubok kolmogorova 2021 komol seniors 8 kolmogorov kubok kolmogorova 2021 goal_exact_bound gábor tardos"}
{"id":"kolmogorov-2021-round1-second-league-problem-10","title":"Антиклики триангуляции выпуклого n-угольника, Кубок Колмогорова 2021","path":"data\\problems\\kolmogorov\\kolmogorov-2021-round1-second-league-problem-10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-round1-second-league-problem-10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-round1-second-league-problem-10","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["planar_graphs","induction","goal_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2021-round1-second-league-problem-10 антиклики триангуляции выпуклого n-угольника, кубок колмогорова 2021 kolmogorov кубок колмогорова 2021 planar_graphs induction goal_counting goal_exact_bound kolmogorov-2021-round1-second-league-problem-10 antikliki triangulyatsii vypuklogo n-ugolnika, kubok kolmogorova 2021 kolmogorov kubok kolmogorova 2021 planar_graphs induction goal_counting goal_exact_bound"}
{"id":"kolmogorov-2021-round1-second-league-problem-8","title":"Одноцветные пути в раскрашенном полном двудольном графе, Кубок Колмогорова 2021","path":"data\\problems\\kolmogorov\\kolmogorov-2021-round1-second-league-problem-8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-round1-second-league-problem-8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-round1-second-league-problem-8","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["coloring","connectivity","double_counting","trees","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2021-round1-second-league-problem-8 одноцветные пути в раскрашенном полном двудольном графе, кубок колмогорова 2021 kolmogorov кубок колмогорова 2021 coloring connectivity double_counting trees goal_existence kolmogorov-2021-round1-second-league-problem-8 odnotsvetnye puti v raskrashennom polnom dvudolnom grafe, kubok kolmogorova 2021 kolmogorov kubok kolmogorova 2021 coloring connectivity double_counting trees goal_existence"}
{"id":"kolmogorov-2021-t1-critical-strong-orientation","title":"Критическая сильная ориентация без хорд в циклах, Кубок Колмогорова 2021 1 тур seniors 5","path":"data\\problems\\kolmogorov\\kolmogorov-2021-t1-critical-strong-orientation.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-t1-critical-strong-orientation.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-t1-critical-strong-orientation","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["connectivity","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"external_theorem_application","search_text":"kolmogorov-2021-t1-critical-strong-orientation критическая сильная ориентация без хорд в циклах, кубок колмогорова 2021 1 тур seniors 5 kolmogorov кубок колмогорова 2021 connectivity goal_construction herbert robbins kolmogorov-2021-t1-critical-strong-orientation kriticheskaya silnaya orientatsiya bez hord v tsiklah, kubok kolmogorova 2021 1 tur seniors 5 kolmogorov kubok kolmogorova 2021 connectivity goal_construction herbert robbins"}
{"id":"kolmogorov-2021-t2-circulant-rainbow-reachability","title":"Радужная достижимость в циркулянтном орграфе, Кубок Колмогорова 2021 2 тур seniors 10","path":"data\\problems\\kolmogorov\\kolmogorov-2021-t2-circulant-rainbow-reachability.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-t2-circulant-rainbow-reachability.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-t2-circulant-rainbow-reachability","source_key":"kolmogorov","source_keys":["kolmogorov","baltic"],"source_label":"Кубок Колмогорова","year":"2021","tags":["coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2021-t2-circulant-rainbow-reachability радужная достижимость в циркулянтном орграфе, кубок колмогорова 2021 2 тур seniors 10 kolmogorov кубок колмогорова 2021 coloring goal_exact_bound kolmogorov-2021-t2-circulant-rainbow-reachability raduzhnaya dostizhimost v tsirkulyantnom orgrafe, kubok kolmogorova 2021 2 tur seniors 10 kolmogorov kubok kolmogorova 2021 coloring goal_exact_bound"}
{"id":"kolmogorov-2021-team-olympiad-seniors-problem-5","title":"Выбор городов для большой Москвы с сохранением связности, Кубок Колмогорова 2021","path":"data\\problems\\kolmogorov\\kolmogorov-2021-team-olympiad-seniors-problem-5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2021-team-olympiad-seniors-problem-5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2021-team-olympiad-seniors-problem-5","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2021","tags":["goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"kolmogorov-2021-team-olympiad-seniors-problem-5 выбор городов для большой москвы с сохранением связности, кубок колмогорова 2021 kolmogorov кубок колмогорова 2021 goal_counting kolmogorov-2021-team-olympiad-seniors-problem-5 vybor gorodov dlya bolshoy moskvy s sohraneniem svyaznosti, kubok kolmogorova 2021 kolmogorov kubok kolmogorova 2021 goal_counting"}
{"id":"kolmogorov-2022-individual-seniors-p2-cycle-arrangements","title":"Циклические расстановки групп, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-individual-seniors-p2-cycle-arrangements.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-individual-seniors-p2-cycle-arrangements.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-individual-seniors-p2-cycle-arrangements","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-individual-seniors-p2-cycle-arrangements циклические расстановки групп, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 goal_counting kolmogorov-2022-individual-seniors-p2-cycle-arrangements tsiklicheskie rasstanovki grupp, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 goal_counting"}
{"id":"kolmogorov-2022-round1-high-edge-count-permutation-nonedges","title":"Максимум рёбер при условии на перестановки не-рёбер, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round1-high-edge-count-permutation-nonedges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round1-high-edge-count-permutation-nonedges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round1-high-edge-count-permutation-nonedges","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["extremal_graph_theory","trees","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round1-high-edge-count-permutation-nonedges максимум рёбер при условии на перестановки не-рёбер, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 extremal_graph_theory trees induction goal_exact_bound kolmogorov-2022-round1-high-edge-count-permutation-nonedges maksimum reber pri uslovii na perestanovki ne-reber, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 extremal_graph_theory trees induction goal_exact_bound"}
{"id":"kolmogorov-2022-round1-third-binary-strings-pairing-graph","title":"Раскраска вершин гиперкуба и паросочетания, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round1-third-binary-strings-pairing-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round1-third-binary-strings-pairing-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round1-third-binary-strings-pairing-graph","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["coloring","matching","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round1-third-binary-strings-pairing-graph раскраска вершин гиперкуба и паросочетания, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 coloring matching double_counting goal_counting kolmogorov-2022-round1-third-binary-strings-pairing-graph raskraska vershin giperkuba i parosochetaniya, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 coloring matching double_counting goal_counting"}
{"id":"kolmogorov-2022-round2-high-colored-integers-infinite-tree","title":"Раскрашенные целые числа и шаблоны с ограниченными промежутками, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round2-high-colored-integers-infinite-tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round2-high-colored-integers-infinite-tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round2-high-colored-integers-infinite-tree","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["trees","coloring","induction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round2-high-colored-integers-infinite-tree раскрашенные целые числа и шаблоны с ограниченными промежутками, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 trees coloring induction goal_existence kolmogorov-2022-round2-high-colored-integers-infinite-tree raskrashennye tselye chisla i shablony s ogranichennymi promezhutkami, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 trees coloring induction goal_existence"}
{"id":"kolmogorov-2022-round2-juniors-hamiltonian-path-parity","title":"Разность чисел одноцветных гамильтоновых путей, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round2-juniors-hamiltonian-path-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round2-juniors-hamiltonian-path-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round2-juniors-hamiltonian-path-parity","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["coloring","hamiltonian_cycles","double_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round2-juniors-hamiltonian-path-parity разность чисел одноцветных гамильтоновых путей, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 coloring hamiltonian_cycles double_counting goal_proof kolmogorov-2022-round2-juniors-hamiltonian-path-parity raznost chisel odnotsvetnyh gamiltonovyh putey, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 coloring hamiltonian_cycles double_counting goal_proof"}
{"id":"kolmogorov-2022-round2-second-third-red-blue-k10-triangles","title":"Красные треугольники в раскрашенном K10, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round2-second-third-red-blue-k10-triangles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round2-second-third-red-blue-k10-triangles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round2-second-third-red-blue-k10-triangles","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["coloring","extremal_graph_theory","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round2-second-third-red-blue-k10-triangles красные треугольники в раскрашенном k10, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 coloring extremal_graph_theory double_counting goal_counting kolmogorov-2022-round2-second-third-red-blue-k10-triangles krasnye treugolniki v raskrashennom k10, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 coloring extremal_graph_theory double_counting goal_counting"}
{"id":"kolmogorov-2022-round4-high-airport-walk-parity","title":"Нечётное число маршрутов между всеми парами аэропортов, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round4-high-airport-walk-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round4-high-airport-walk-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round4-high-airport-walk-parity","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["eulerian_graphs","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round4-high-airport-walk-parity нечётное число маршрутов между всеми парами аэропортов, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 eulerian_graphs goal_counting kolmogorov-2022-round4-high-airport-walk-parity nechetnoe chislo marshrutov mezhdu vsemi parami aeroportov, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 eulerian_graphs goal_counting"}
{"id":"kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles","title":"Дерево максимальной длины на точках и окружности на диаметрах, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles дерево максимальной длины на точках и окружности на диаметрах, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 trees goal_exact_bound kolmogorov-2022-round4-high-maximum-length-tree-diameter-circles derevo maksimalnoy dliny na tochkah i okruzhnosti na diametrah, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 trees goal_exact_bound"}
{"id":"kolmogorov-2022-round4-second-third-even-degree-odd-walks","title":"Чётные степени и нечётные числа маршрутов, Кубок Колмогорова 2022","path":"data\\problems\\kolmogorov\\kolmogorov-2022-round4-second-third-even-degree-odd-walks.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2022-round4-second-third-even-degree-odd-walks.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2022-round4-second-third-even-degree-odd-walks","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2022","tags":["eulerian_graphs","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2022-round4-second-third-even-degree-odd-walks чётные степени и нечётные числа маршрутов, кубок колмогорова 2022 kolmogorov кубок колмогорова 2022 eulerian_graphs goal_existence kolmogorov-2022-round4-second-third-even-degree-odd-walks chetnye stepeni i nechetnye chisla marshrutov, kubok kolmogorova 2022 kolmogorov kubok kolmogorova 2022 eulerian_graphs goal_existence"}
{"id":"kolmogorov-2023-lichol-large-monochromatic-bipartite-component","title":"Большая одноцветная компонента в полном двудольном графе, Кубок Колмогорова 2023 личная juniors 6","path":"data\\problems\\kolmogorov\\kolmogorov-2023-lichol-large-monochromatic-bipartite-component.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2023-lichol-large-monochromatic-bipartite-component.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2023-lichol-large-monochromatic-bipartite-component","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2023","tags":["coloring","matching","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"kolmogorov-2023-lichol-large-monochromatic-bipartite-component большая одноцветная компонента в полном двудольном графе, кубок колмогорова 2023 личная juniors 6 kolmogorov кубок колмогорова 2023 coloring matching goal_counting dragomir grozev kolmogorov-2023-lichol-large-monochromatic-bipartite-component bolshaya odnotsvetnaya komponenta v polnom dvudolnom grafe, kubok kolmogorova 2023 lichnaya juniors 6 kolmogorov kubok kolmogorova 2023 coloring matching goal_counting dragomir grozev"}
{"id":"kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree","title":"Кратчайшие пути в мультиграфе степени не выше 2m, Кубок Колмогорова 2024","path":"data\\problems\\kolmogorov\\kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/kolmogorov/kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree","source_key":"kolmogorov","source_keys":["kolmogorov"],"source_label":"Кубок Колмогорова","year":"2024","tags":["extremal_graph_theory","connectivity","degree_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree кратчайшие пути в мультиграфе степени не выше 2m, кубок колмогорова 2024 kolmogorov кубок колмогорова 2024 extremal_graph_theory connectivity degree_counting construction goal_exact_bound kolmogorov-2024-t1-seniors-2-shortest-paths-even-degree kratchayshie puti v multigrafe stepeni ne vyshe 2m, kubok kolmogorova 2024 kolmogorov kubok kolmogorova 2024 extremal_graph_theory connectivity degree_counting construction goal_exact_bound"}
{"id":"konig-line-coloring-bipartite","title":"Теорема Кёнига о рёберной раскраске двудольного графа","path":"data\\problems\\classical\\konig-line-coloring-bipartite.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/konig-line-coloring-bipartite.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#konig-line-coloring-bipartite","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","coloring","classical_theorem","goal_exact_bound","induction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"konig-line-coloring-bipartite теорема кёнига о рёберной раскраске двудольного графа misc прочее matching coloring classical_theorem goal_exact_bound induction dénes kőnig konig-line-coloring-bipartite teorema keniga o rebernoy raskraske dvudolnogo grafa misc prochee matching coloring classical_theorem goal_exact_bound induction dénes kőnig"}
{"id":"konig-vertex-cover-theorem","title":"Теорема Кёнига о паросочетании и покрытии","path":"data\\problems\\classical\\konig-vertex-cover-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/konig-vertex-cover-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#konig-vertex-cover-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","augmenting_path","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"konig-vertex-cover-theorem теорема кёнига о паросочетании и покрытии misc прочее matching augmenting_path classical_theorem goal_exact_bound dénes kőnig konig-vertex-cover-theorem teorema keniga o parosochetanii i pokrytii misc prochee matching augmenting_path classical_theorem goal_exact_bound dénes kőnig"}
{"id":"lehman-shannon-switching-game-two-spanning-trees","title":"Игра Шеннона: критерий двух остовных деревьев","path":"data\\problems\\classical\\lehman-shannon-switching-game-two-spanning-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/lehman-shannon-switching-game-two-spanning-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lehman-shannon-switching-game-two-spanning-trees","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","connectivity","graph_cut","induction","goal_strategy_game","goal_characterization","classical_theorem"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"lehman-shannon-switching-game-two-spanning-trees игра шеннона: критерий двух остовных деревьев misc прочее trees connectivity graph_cut induction goal_strategy_game goal_characterization classical_theorem alfred lehman lehman-shannon-switching-game-two-spanning-trees igra shennona: kriteriy dvuh ostovnyh derevev misc prochee trees connectivity graph_cut induction goal_strategy_game goal_characterization classical_theorem alfred lehman"}
{"id":"line-arrangement-side-count-levels","title":"Счётчик сторон в расположении прямых принимает все уровни","path":"data\\problems\\classical\\line-arrangement-side-count-levels.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/line-arrangement-side-count-levels.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#line-arrangement-side-count-levels","source_key":"misc","source_keys":["misc","cmo"],"source_label":"Прочее","year":"","tags":["planar_graphs","coloring","classical_theorem","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"line-arrangement-side-count-levels счётчик сторон в расположении прямых принимает все уровни misc прочее planar_graphs coloring classical_theorem goal_existence line-arrangement-side-count-levels schetchik storon v raspolozhenii pryamyh prinimaet vse urovni misc prochee planar_graphs coloring classical_theorem goal_existence"}
{"id":"lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3","title":"Белла и Чингиз с начальным совершенным паросочетанием, версии 1:2 и 1:3","path":"data\\problems\\lktg\\lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3","source_key":"lktg","source_keys":["lktg","yumt"],"source_label":"LKTG","year":"2026","tags":["coloring","matching","graph_symmetry","invariant","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3 белла и чингиз с начальным совершенным паросочетанием, версии 1:2 и 1:3 lktg lktg 2026 coloring matching graph_symmetry invariant goal_strategy_game lktg-2026-bella-chingiz-perfect-matching-bias-1-2-and-1-3 bella i chingiz s nachalnym sovershennym parosochetaniem, versii 1:2 i 1:3 lktg lktg 2026 coloring matching graph_symmetry invariant goal_strategy_game"}
{"id":"lktg-2026-project2-problem01-no-return-game","title":"Игра без возвращений: критерий совершенного паросочетания и варианты старта","path":"data\\problems\\lktg\\lktg-2026-project2-problem01-no-return-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem01-no-return-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem01-no-return-game","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["matching","augmenting_path","extremal_choice","goal_characterization","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem01-no-return-game игра без возвращений: критерий совершенного паросочетания и варианты старта lktg lktg 2026 matching augmenting_path extremal_choice goal_characterization goal_strategy_game fraenkel scheinerman ullman lktg-2026-project2-problem01-no-return-game igra bez vozvrascheniy: kriteriy sovershennogo parosochetaniya i varianty starta lktg lktg 2026 matching augmenting_path extremal_choice goal_characterization goal_strategy_game fraenkel scheinerman ullman"}
{"id":"lktg-2026-project2-problem02-coins-on-graph","title":"Монеты на графе: выигрышный старт на пути, дереве и цикле","path":"data\\problems\\lktg\\lktg-2026-project2-problem02-coins-on-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem02-coins-on-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem02-coins-on-graph","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["trees","invariant","extremal_choice","construction","goal_strategy_game","goal_impossibility"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem02-coins-on-graph монеты на графе: выигрышный старт на пути, дереве и цикле lktg lktg 2026 trees invariant extremal_choice construction goal_strategy_game goal_impossibility lktg-2026-project2-problem02-coins-on-graph monety na grafe: vyigryshnyy start na puti, dereve i tsikle lktg lktg 2026 trees invariant extremal_choice construction goal_strategy_game goal_impossibility"}
{"id":"lktg-2026-project2-problem04-connectivity-edge-game","title":"Добавление рёбер до первой связности","path":"data\\problems\\lktg\\lktg-2026-project2-problem04-connectivity-edge-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem04-connectivity-edge-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem04-connectivity-edge-game","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["connectivity","invariant","parity_coloring","extremal_choice","goal_classification","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem04-connectivity-edge-game добавление рёбер до первой связности lktg lktg 2026 connectivity invariant parity_coloring extremal_choice goal_classification goal_strategy_game l. csirmaz lktg-2026-project2-problem04-connectivity-edge-game dobavlenie reber do pervoy svyaznosti lktg lktg 2026 connectivity invariant parity_coloring extremal_choice goal_classification goal_strategy_game l. csirmaz"}
{"id":"lktg-2026-project2-problem06-two-tokens-reversing-arcs","title":"Две фишки и развороты пройденных стрелок","path":"data\\problems\\lktg\\lktg-2026-project2-problem06-two-tokens-reversing-arcs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem06-two-tokens-reversing-arcs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem06-two-tokens-reversing-arcs","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["invariant","potential_function","dynamics","construction","goal_strategy_game","goal_bound"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem06-two-tokens-reversing-arcs две фишки и развороты пройденных стрелок lktg lktg 2026 invariant potential_function dynamics construction goal_strategy_game goal_bound м. дидин lktg-2026-project2-problem06-two-tokens-reversing-arcs dve fishki i razvoroty proydennyh strelok lktg lktg 2026 invariant potential_function dynamics construction goal_strategy_game goal_bound m. didin"}
{"id":"lktg-2026-project2-problem07-two-degenerate-orientation-game","title":"Парная стратегия против ориентированного цикла: 2-вырожденные графы и решётки","path":"data\\problems\\lktg\\lktg-2026-project2-problem07-two-degenerate-orientation-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem07-two-degenerate-orientation-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem07-two-degenerate-orientation-game","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["induction","invariant","goal_characterization","goal_strategy_game","dynamics","planar_graphs","graph_symmetry","extremal_choice"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem07-two-degenerate-orientation-game парная стратегия против ориентированного цикла: 2-вырожденные графы и решётки lktg lktg 2026 induction invariant goal_characterization goal_strategy_game dynamics planar_graphs graph_symmetry extremal_choice lktg-2026-project2-problem07-two-degenerate-orientation-game parnaya strategiya protiv orientirovannogo tsikla: 2-vyrozhdennye grafy i reshetki lktg lktg 2026 induction invariant goal_characterization goal_strategy_game dynamics planar_graphs graph_symmetry extremal_choice"}
{"id":"lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game","title":"Игра Боллобаша-Сабо: плотное ядро и принудительный ориентированный цикл","path":"data\\problems\\lktg\\lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["extremal_graph_theory","classical_theorem","eulerian_graphs","matching","double_counting","minimal_counterexample","invariant","construction","goal_strategy_game","goal_proof"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game игра боллобаша-сабо: плотное ядро и принудительный ориентированный цикл lktg lktg 2026 extremal_graph_theory classical_theorem eulerian_graphs matching double_counting minimal_counterexample invariant construction goal_strategy_game goal_proof b. bollobás t. szabó lktg-2026-project2-problem09-bollobas-szabo-oriented-cycle-game igra bollobasha-sabo: plotnoe yadro i prinuditelnyy orientirovannyy tsikl lktg lktg 2026 extremal_graph_theory classical_theorem eulerian_graphs matching double_counting minimal_counterexample invariant construction goal_strategy_game goal_proof b. bollobás t. szabó"}
{"id":"lktg-2026-project2-problem11-symmetric-erdos-game","title":"Симметричная игра Эрдёша по кликовым числам, ЛКТГ 2026","path":"data\\problems\\lktg\\lktg-2026-project2-problem11-symmetric-erdos-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem11-symmetric-erdos-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem11-symmetric-erdos-game","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["coloring","graph_symmetry","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_partial_with_open_subproblems","search_text":"lktg-2026-project2-problem11-symmetric-erdos-game симметричная игра эрдёша по кликовым числам, лктг 2026 lktg лктг 2026 coloring graph_symmetry goal_strategy_game lktg-2026-project2-problem11-symmetric-erdos-game simmetrichnaya igra erdesha po klikovym chislam, lktg 2026 lktg lktg 2026 coloring graph_symmetry goal_strategy_game"}
{"id":"lktg-2026-project2-problem12-biased-game-one-two","title":"Смещённая кликовая игра \\(1:2\\) на \\(K_n\\), ЛКТГ 2026","path":"data\\problems\\lktg\\lktg-2026-project2-problem12-biased-game-one-two.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem12-biased-game-one-two.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem12-biased-game-one-two","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["coloring","goal_strategy_game","complement_graph_transition"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem12-biased-game-one-two смещённая кликовая игра \\(1:2\\) на \\(k_n\\), лктг 2026 lktg лктг 2026 coloring goal_strategy_game complement_graph_transition lktg-2026-project2-problem12-biased-game-one-two smeschennaya klikovaya igra \\(1:2\\) na \\(k_n\\), lktg 2026 lktg lktg 2026 coloring goal_strategy_game complement_graph_transition"}
{"id":"lktg-2026-project2-problem13-bella-chingiz-complete-graph","title":"Белла и Чингиз: сравнение белой и чёрной клик на полном графе","path":"data\\problems\\lktg\\lktg-2026-project2-problem13-bella-chingiz-complete-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem13-bella-chingiz-complete-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem13-bella-chingiz-complete-graph","source_key":"lktg","source_keys":["lktg","yumt"],"source_label":"LKTG","year":"2026","tags":["coloring","goal_strategy_game","construction","process_invariant","trees","extremal_graph_theory","ramsey_theory","goal_proof"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_partial_with_open_subproblems","search_text":"lktg-2026-project2-problem13-bella-chingiz-complete-graph белла и чингиз: сравнение белой и чёрной клик на полном графе lktg lktg 2026 coloring goal_strategy_game construction process_invariant trees extremal_graph_theory ramsey_theory goal_proof lktg-2026-project2-problem13-bella-chingiz-complete-graph bella i chingiz: sravnenie beloy i chernoy klik na polnom grafe lktg lktg 2026 coloring goal_strategy_game construction process_invariant trees extremal_graph_theory ramsey_theory goal_proof"}
{"id":"lktg-2026-project2-problem14-white-clique-infinite-board","title":"Белая клика в смещённой игре на \\(K_\\infty\\), ЛКТГ 2026","path":"data\\problems\\lktg\\lktg-2026-project2-problem14-white-clique-infinite-board.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem14-white-clique-infinite-board.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem14-white-clique-infinite-board","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["coloring","goal_bound","goal_strategy_game","potential_function","pigeonhole_principle","trees","double_counting"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_partial_with_open_subproblems","search_text":"lktg-2026-project2-problem14-white-clique-infinite-board белая клика в смещённой игре на \\(k_\\infty\\), лктг 2026 lktg лктг 2026 coloring goal_bound goal_strategy_game potential_function pigeonhole_principle trees double_counting lktg-2026-project2-problem14-white-clique-infinite-board belaya klika v smeschennoy igre na \\(k_\\infty\\), lktg 2026 lktg lktg 2026 coloring goal_bound goal_strategy_game potential_function pigeonhole_principle trees double_counting"}
{"id":"lktg-2026-project2-problem15-game-transfer-one-two-to-one","title":"Перенос белой клики из игры \\(1:2\\) в игру \\(1:1\\), ЛКТГ 2026","path":"data\\problems\\lktg\\lktg-2026-project2-problem15-game-transfer-one-two-to-one.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem15-game-transfer-one-two-to-one.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem15-game-transfer-one-two-to-one","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["coloring","goal_proof","goal_strategy_game","double_counting"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem15-game-transfer-one-two-to-one перенос белой клики из игры \\(1:2\\) в игру \\(1:1\\), лктг 2026 lktg лктг 2026 coloring goal_proof goal_strategy_game double_counting chatgpt lktg-2026-project2-problem15-game-transfer-one-two-to-one perenos beloy kliki iz igry \\(1:2\\) v igru \\(1:1\\), lktg 2026 lktg lktg 2026 coloring goal_proof goal_strategy_game double_counting chatgpt"}
{"id":"lktg-2026-project2-problem16-biconnected-red-board","title":"Двусвязная доска произвольного размера для победы Красного, ЛКТГ 2026","path":"data\\problems\\lktg\\lktg-2026-project2-problem16-biconnected-red-board.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem16-biconnected-red-board.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem16-biconnected-red-board","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["coloring","goal_construction","goal_strategy_game","connectivity"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem16-biconnected-red-board двусвязная доска произвольного размера для победы красного, лктг 2026 lktg лктг 2026 coloring goal_construction goal_strategy_game connectivity lktg-2026-project2-problem16-biconnected-red-board dvusvyaznaya doska proizvolnogo razmera dlya pobedy krasnogo, lktg 2026 lktg lktg 2026 coloring goal_construction goal_strategy_game connectivity"}
{"id":"lktg-2026-project2-problem17-firms-and-geniuses","title":"Фирмы и отмеченные гении в графе знакомств","path":"data\\problems\\lktg\\lktg-2026-project2-problem17-firms-and-geniuses.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem17-firms-and-geniuses.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem17-firms-and-geniuses","source_key":"lktg","source_keys":["lktg","tc"],"source_label":"LKTG","year":"2026","tags":["goal_construction","goal_strategy_game","connectivity","process_invariant"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem17-firms-and-geniuses фирмы и отмеченные гении в графе знакомств lktg lktg 2026 goal_construction goal_strategy_game connectivity process_invariant шаповалов а.в. lktg-2026-project2-problem17-firms-and-geniuses firmy i otmechennye genii v grafe znakomstv lktg lktg 2026 goal_construction goal_strategy_game connectivity process_invariant shapovalov a.v."}
{"id":"lktg-2026-project2-problem20-white-target-family","title":"Весовая лемма для белых целей, клик и гамильтоновых циклов","path":"data\\problems\\lktg\\lktg-2026-project2-problem20-white-target-family.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem20-white-target-family.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem20-white-target-family","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["extremal_graph_theory","coloring","potential_function","extremal_choice","goal_bound","goal_strategy_game","hamiltonian_cycles","goal_impossibility"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem20-white-target-family весовая лемма для белых целей, клик и гамильтоновых циклов lktg lktg 2026 extremal_graph_theory coloring potential_function extremal_choice goal_bound goal_strategy_game hamiltonian_cycles goal_impossibility lktg-2026-project2-problem20-white-target-family vesovaya lemma dlya belyh tseley, klik i gamiltonovyh tsiklov lktg lktg 2026 extremal_graph_theory coloring potential_function extremal_choice goal_bound goal_strategy_game hamiltonian_cycles goal_impossibility"}
{"id":"lktg-2026-project2-problem21-black-minimum-degree","title":"Почти пропорциональная нижняя оценка чёрной степени каждой вершины, ЛКТГ 2026 №21","path":"data\\problems\\lktg\\lktg-2026-project2-problem21-black-minimum-degree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem21-black-minimum-degree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem21-black-minimum-degree","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["extremal_graph_theory","coloring","potential_function","degree_counting","goal_bound","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem21-black-minimum-degree почти пропорциональная нижняя оценка чёрной степени каждой вершины, лктг 2026 №21 lktg лктг 2026 extremal_graph_theory coloring potential_function degree_counting goal_bound goal_strategy_game lktg-2026-project2-problem21-black-minimum-degree pochti proportsionalnaya nizhnyaya otsenka chernoy stepeni kazhdoy vershiny, lktg 2026 №21 lktg lktg 2026 extremal_graph_theory coloring potential_function degree_counting goal_bound goal_strategy_game"}
{"id":"lktg-2026-project2-problem22-density-in-large-subsets","title":"Чёрная плотность во всех больших множествах и между ними","path":"data\\problems\\lktg\\lktg-2026-project2-problem22-density-in-large-subsets.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem22-density-in-large-subsets.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem22-density-in-large-subsets","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["extremal_graph_theory","coloring","potential_function","goal_bound","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem22-density-in-large-subsets чёрная плотность во всех больших множествах и между ними lktg lktg 2026 extremal_graph_theory coloring potential_function goal_bound goal_strategy_game lktg-2026-project2-problem22-density-in-large-subsets chernaya plotnost vo vseh bolshih mnozhestvah i mezhdu nimi lktg lktg 2026 extremal_graph_theory coloring potential_function goal_bound goal_strategy_game"}
{"id":"lktg-2026-project2-problem24-white-clique-black-degrees","title":"Одна стратегия против белой клики и малых чёрных степеней, ЛКТГ 2026 №24","path":"data\\problems\\lktg\\lktg-2026-project2-problem24-white-clique-black-degrees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem24-white-clique-black-degrees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem24-white-clique-black-degrees","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["extremal_graph_theory","coloring","potential_function","degree_counting","goal_bound","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem24-white-clique-black-degrees одна стратегия против белой клики и малых чёрных степеней, лктг 2026 №24 lktg лктг 2026 extremal_graph_theory coloring potential_function degree_counting goal_bound goal_strategy_game lktg-2026-project2-problem24-white-clique-black-degrees odna strategiya protiv beloy kliki i malyh chernyh stepeney, lktg 2026 №24 lktg lktg 2026 extremal_graph_theory coloring potential_function degree_counting goal_bound goal_strategy_game"}
{"id":"lktg-2026-project2-problem26-golden-ratio-biased-game","title":"Смещённая игра в клики: общая теорема и количественный случай 1:2","path":"data\\problems\\lktg\\lktg-2026-project2-problem26-golden-ratio-biased-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem26-golden-ratio-biased-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem26-golden-ratio-biased-game","source_key":"lktg","source_keys":["lktg"],"source_label":"LKTG","year":"2026","tags":["extremal_graph_theory","coloring","ramsey_theory","potential_function","degree_counting","goal_strategy_game","goal_bound"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem26-golden-ratio-biased-game смещённая игра в клики: общая теорема и количественный случай 1:2 lktg lktg 2026 extremal_graph_theory coloring ramsey_theory potential_function degree_counting goal_strategy_game goal_bound максим дидин марк пименов lktg-2026-project2-problem26-golden-ratio-biased-game smeschennaya igra v kliki: obschaya teorema i kolichestvennyy sluchay 1:2 lktg lktg 2026 extremal_graph_theory coloring ramsey_theory potential_function degree_counting goal_strategy_game goal_bound maksim didin mark pimenov"}
{"id":"lktg-2026-project2-problem28-rock-paper-scissors-dynamics","title":"Стабилизация камня, ножниц и бумаги на деревьях и вечная динамика на циклах, ЛКТГ 2026 №28","path":"data\\problems\\lktg\\lktg-2026-project2-problem28-rock-paper-scissors-dynamics.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem28-rock-paper-scissors-dynamics.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem28-rock-paper-scissors-dynamics","source_key":"lktg","source_keys":["lktg","hse"],"source_label":"ЛКТГ","year":"2026","tags":["trees","dynamics","modular_coloring","process_invariant","potential_function","goal_exact_bound","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem28-rock-paper-scissors-dynamics стабилизация камня, ножниц и бумаги на деревьях и вечная динамика на циклах, лктг 2026 №28 lktg лктг 2026 trees dynamics modular_coloring process_invariant potential_function goal_exact_bound goal_proof марк пименов lktg-2026-project2-problem28-rock-paper-scissors-dynamics stabilizatsiya kamnya, nozhnits i bumagi na derevyah i vechnaya dinamika na tsiklah, lktg 2026 №28 lktg lktg 2026 trees dynamics modular_coloring process_invariant potential_function goal_exact_bound goal_proof mark pimenov"}
{"id":"lktg-2026-project2-problem29-two-leagues-tournament","title":"Выбор команд в две лиги и большинство межлиговых побед, ЛКТГ 2026 №29","path":"data\\problems\\lktg\\lktg-2026-project2-problem29-two-leagues-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/lktg/lktg-2026-project2-problem29-two-leagues-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#lktg-2026-project2-problem29-two-leagues-tournament","source_key":"lktg","source_keys":["lktg"],"source_label":"ЛКТГ","year":"2026","tags":["tournaments","double_counting","extremal_choice","construction","goal_strategy_game","goal_classification"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"lktg-2026-project2-problem29-two-leagues-tournament выбор команд в две лиги и большинство межлиговых побед, лктг 2026 №29 lktg лктг 2026 tournaments double_counting extremal_choice construction goal_strategy_game goal_classification марк пименов lktg-2026-project2-problem29-two-leagues-tournament vybor komand v dve ligi i bolshinstvo mezhligovyh pobed, lktg 2026 №29 lktg lktg 2026 tournaments double_counting extremal_choice construction goal_strategy_game goal_classification mark pimenov"}
{"id":"longest-path-endpoints-shortest-detour","title":"Кратчайший обход между концами максимального пути","path":"data\\problems\\classical\\longest-path-endpoints-shortest-detour.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/longest-path-endpoints-shortest-detour.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#longest-path-endpoints-shortest-detour","source_key":"misc","source_keys":["misc","bmo"],"source_label":"Прочее","year":"","tags":["hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"longest-path-endpoints-shortest-detour кратчайший обход между концами максимального пути misc прочее hamiltonian_cycles goal_exact_bound longest-path-endpoints-shortest-detour kratchayshiy obhod mezhdu kontsami maksimalnogo puti misc prochee hamiltonian_cycles goal_exact_bound"}
{"id":"malekshahian-spiro-biased-clique-building-game","title":"Смещённая игра в клики: асимптотическая победа второго игрока","path":"data\\problems\\classical\\malekshahian-spiro-biased-clique-building-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/malekshahian-spiro-biased-clique-building-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#malekshahian-spiro-biased-clique-building-game","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","ramsey_theory","goal_strategy_game","goal_bound","classical_theorem"],"agent_topics":["game_strategy"],"solution_state":"without_solution","solution_classification_type":"hard_external_theorem_no_proof","search_text":"malekshahian-spiro-biased-clique-building-game смещённая игра в клики: асимптотическая победа второго игрока misc прочее extremal_graph_theory ramsey_theory goal_strategy_game goal_bound classical_theorem alexandru malekshahian sam spiro malekshahian-spiro-biased-clique-building-game smeschennaya igra v kliki: asimptoticheskaya pobeda vtorogo igroka misc prochee extremal_graph_theory ramsey_theory goal_strategy_game goal_bound classical_theorem alexandru malekshahian sam spiro"}
{"id":"mantel-theorem","title":"Теорема Мантеля о максимуме рёбер без треугольников","path":"data\\problems\\classical\\mantel-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/mantel-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mantel-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","forbidden_triangle","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"mantel-theorem теорема мантеля о максимуме рёбер без треугольников misc прочее extremal_graph_theory forbidden_triangle classical_theorem goal_characterization willem mantel mantel-theorem teorema mantelya o maksimume reber bez treugolnikov misc prochee extremal_graph_theory forbidden_triangle classical_theorem goal_characterization willem mantel"}
{"id":"maximum-spanning-tree-cycle-shortest-edge-lemma","title":"Строго кратчайшее ребро цикла не входит в максимальный остов","path":"data\\problems\\classical\\maximum-spanning-tree-cycle-shortest-edge-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/maximum-spanning-tree-cycle-shortest-edge-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#maximum-spanning-tree-cycle-shortest-edge-lemma","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["trees","extremal_choice","goal_proof","classical_lemma"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution_lemma_extracted","search_text":"maximum-spanning-tree-cycle-shortest-edge-lemma строго кратчайшее ребро цикла не входит в максимальный остов misc прочее trees extremal_choice goal_proof classical_lemma maximum-spanning-tree-cycle-shortest-edge-lemma strogo kratchayshee rebro tsikla ne vhodit v maksimalnyy ostov misc prochee trees extremal_choice goal_proof classical_lemma"}
{"id":"memo-2021-i2-bishop-circuit-forest","title":"Красные клетки без слоновых циклов, MEMO 2021 I-2","path":"data\\problems\\memo\\memo-2021-i2-bishop-circuit-forest.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/memo/memo-2021-i2-bishop-circuit-forest.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#memo-2021-i2-bishop-circuit-forest","source_key":"memo","source_keys":["memo"],"source_label":"MEMO","year":"2021","tags":["connectivity","trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"memo-2021-i2-bishop-circuit-forest красные клетки без слоновых циклов, memo 2021 i-2 memo memo 2021 connectivity trees goal_exact_bound memo-2021-i2-bishop-circuit-forest krasnye kletki bez slonovyh tsiklov, memo 2021 i-2 memo memo 2021 connectivity trees goal_exact_bound"}
{"id":"memo-2022-t4-teleport-table-reachability","title":"Телепорты на доске и паритет достижимости, MEMO 2022 T-4","path":"data\\problems\\memo\\memo-2022-t4-teleport-table-reachability.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/memo/memo-2022-t4-teleport-table-reachability.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#memo-2022-t4-teleport-table-reachability","source_key":"memo","source_keys":["memo"],"source_label":"MEMO","year":"2022","tags":["connectivity","matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"memo-2022-t4-teleport-table-reachability телепорты на доске и паритет достижимости, memo 2022 t-4 memo memo 2022 connectivity matching goal_proof memo-2022-t4-teleport-table-reachability teleporty na doske i paritet dostizhimosti, memo 2022 t-4 memo memo 2022 connectivity matching goal_proof"}
{"id":"memo-2025-i2-ruby-rooks-two-step-reachability","title":"Рубиновые ладьи и двухшаговая достижимость, MEMO 2025 I-2","path":"data\\problems\\memo\\memo-2025-i2-ruby-rooks-two-step-reachability.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/memo/memo-2025-i2-ruby-rooks-two-step-reachability.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#memo-2025-i2-ruby-rooks-two-step-reachability","source_key":"memo","source_keys":["memo"],"source_label":"MEMO","year":"2025","tags":["connectivity","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"memo-2025-i2-ruby-rooks-two-step-reachability рубиновые ладьи и двухшаговая достижимость, memo 2025 i-2 memo memo 2025 connectivity double_counting goal_exact_bound mark neumann memo-2025-i2-ruby-rooks-two-step-reachability rubinovye ladi i dvuhshagovaya dostizhimost, memo 2025 i-2 memo memo 2025 connectivity double_counting goal_exact_bound mark neumann"}
{"id":"memo-2025-t4-toll-complete-graph","title":"Платные дороги как взвешенный полный граф, MEMO 2025 T-4","path":"data\\problems\\memo\\memo-2025-t4-toll-complete-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/memo/memo-2025-t4-toll-complete-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#memo-2025-t4-toll-complete-graph","source_key":"memo","source_keys":["memo"],"source_label":"MEMO","year":"2025","tags":["double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"memo-2025-t4-toll-complete-graph платные дороги как взвешенный полный граф, memo 2025 t-4 memo memo 2025 double_counting goal_exact_bound paulius aleknavičius memo-2025-t4-toll-complete-graph platnye dorogi kak vzveshennyy polnyy graf, memo 2025 t-4 memo memo 2025 double_counting goal_exact_bound paulius aleknavičius"}
{"id":"menger-theorem","title":"Теорема Менгера о непересекающихся путях и разрезах","path":"data\\problems\\classical\\menger-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/menger-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#menger-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["connectivity","graph_cut","augmenting_path","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"menger-theorem теорема менгера о непересекающихся путях и разрезах misc прочее connectivity graph_cut augmenting_path classical_theorem goal_exact_bound karl menger menger-theorem teorema mengera o neperesekayuschihsya putyah i razrezah misc prochee connectivity graph_cut augmenting_path classical_theorem goal_exact_bound karl menger"}
{"id":"miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings","title":"Ненулевые члены детерминанта как совершенные паросочетания, Schweitzer 1951/13","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1951","tags":["matching","graph_model","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings ненулевые члены детерминанта как совершенные паросочетания, schweitzer 1951/13 miklos schweitzer 1951 matching graph_model double_counting goal_counting miklos-schweitzer-1951-p13-determinant-nonzero-pattern-matchings nenulevye chleny determinanta kak sovershennye parosochetaniya, schweitzer 1951/13 miklos schweitzer 1951 matching graph_model double_counting goal_counting"}
{"id":"miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence","title":"Возвратность случайного блуждания на треугольной решётке, Schweitzer 1953/10","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1953","tags":["graph_model","planar_graphs","classical_lemma","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"complete_ai_checked","search_text":"miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence возвратность случайного блуждания на треугольной решётке, schweitzer 1953/10 miklos schweitzer 1953 graph_model planar_graphs classical_lemma goal_proof miklos-schweitzer-1953-p10-triangular-lattice-random-walk-recurrence vozvratnost sluchaynogo bluzhdaniya na treugolnoy reshetke, schweitzer 1953/10 miklos schweitzer 1953 graph_model planar_graphs classical_lemma goal_proof"}
{"id":"miklos-schweitzer-1953-p2-chessboard-related-pairs","title":"Связанные пары белых и чёрных фигур на шахматной доске, Schweitzer 1953/2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1953-p2-chessboard-related-pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1953-p2-chessboard-related-pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1953-p2-chessboard-related-pairs","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1953","tags":["graph_model","degree_counting","double_counting","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"complete_ai_checked","search_text":"miklos-schweitzer-1953-p2-chessboard-related-pairs связанные пары белых и чёрных фигур на шахматной доске, schweitzer 1953/2 miklos schweitzer 1953 graph_model degree_counting double_counting extremal_choice goal_exact_bound miklos-schweitzer-1953-p2-chessboard-related-pairs svyazannye pary belyh i chernyh figur na shahmatnoy doske, schweitzer 1953/2 miklos schweitzer 1953 graph_model degree_counting double_counting extremal_choice goal_exact_bound"}
{"id":"miklos-schweitzer-1954-p9-translated-broken-line-intersection","title":"Сдвиги простой ломаной на доли вектора, Schweitzer 1954/9","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1954-p9-translated-broken-line-intersection.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1954-p9-translated-broken-line-intersection.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1954-p9-translated-broken-line-intersection","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1954","tags":["planar_graphs","connectivity","induction","graph_model","goal_proof","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-1954-p9-translated-broken-line-intersection сдвиги простой ломаной на доли вектора, schweitzer 1954/9 miklos schweitzer 1954 planar_graphs connectivity induction graph_model goal_proof goal_impossibility miklos-schweitzer-1954-p9-translated-broken-line-intersection sdvigi prostoy lomanoy na doli vektora, schweitzer 1954/9 miklos schweitzer 1954 planar_graphs connectivity induction graph_model goal_proof goal_impossibility"}
{"id":"miklos-schweitzer-1956-p3-convex-polygon-triangulations","title":"Триангуляции выпуклого многоугольника, Schweitzer 1956/3","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1956-p3-convex-polygon-triangulations.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1956-p3-convex-polygon-triangulations.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1956-p3-convex-polygon-triangulations","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1956","tags":["planar_graphs","trees","induction","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-1956-p3-convex-polygon-triangulations триангуляции выпуклого многоугольника, schweitzer 1956/3 miklos schweitzer 1956 planar_graphs trees induction double_counting goal_counting miklos-schweitzer-1956-p3-convex-polygon-triangulations triangulyatsii vypuklogo mnogougolnika, schweitzer 1956/3 miklos schweitzer 1956 planar_graphs trees induction double_counting goal_counting"}
{"id":"miklos-schweitzer-1959-p10-even-circuit-edge-bound","title":"Чётный цикл в графе с 2n+1 вершинами и 3n+1 рёбрами, Schweitzer 1959/10","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-1959-p10-even-circuit-edge-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-1959-p10-even-circuit-edge-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-1959-p10-even-circuit-edge-bound","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"1959","tags":["extremal_graph_theory","trees","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-1959-p10-even-circuit-edge-bound чётный цикл в графе с 2n+1 вершинами и 3n+1 рёбрами, schweitzer 1959/10 miklos schweitzer 1959 extremal_graph_theory trees extremal_choice construction goal_exact_bound miklos-schweitzer-1959-p10-even-circuit-edge-bound chetnyy tsikl v grafe s 2n+1 vershinami i 3n+1 rebrami, schweitzer 1959/10 miklos schweitzer 1959 extremal_graph_theory trees extremal_choice construction goal_exact_bound"}
{"id":"miklos-schweitzer-2002-p2-edge-connected-short-paths","title":"Короткие рёберно-непересекающиеся пути в k-рёберно-связном графе, Schweitzer 2002/2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2002-p2-edge-connected-short-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2002-p2-edge-connected-short-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2002-p2-edge-connected-short-paths","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2002","tags":["connectivity","degree_counting","cut_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_complete_heavy_external_theorem_application","search_text":"miklos-schweitzer-2002-p2-edge-connected-short-paths короткие рёберно-непересекающиеся пути в k-рёберно-связном графе, schweitzer 2002/2 miklos schweitzer 2002 connectivity degree_counting cut_counting goal_existence miklos-schweitzer-2002-p2-edge-connected-short-paths korotkie reberno-neperesekayuschiesya puti v k-reberno-svyaznom grafe, schweitzer 2002/2 miklos schweitzer 2002 connectivity degree_counting cut_counting goal_existence"}
{"id":"miklos-schweitzer-2004-p2-quasirandom-k4-count","title":"Сравнение числа полных четырехвершинников по всем индуцированным числам ребер, Schweitzer 2004/2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2004-p2-quasirandom-k4-count.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2004-p2-quasirandom-k4-count.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2004-p2-quasirandom-k4-count","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2004","tags":["extremal_graph_theory","double_counting","forbidden_clique","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"miklos-schweitzer-2004-p2-quasirandom-k4-count сравнение числа полных четырехвершинников по всем индуцированным числам ребер, schweitzer 2004/2 miklos schweitzer 2004 extremal_graph_theory double_counting forbidden_clique goal_bound miklos-schweitzer-2004-p2-quasirandom-k4-count sravnenie chisla polnyh chetyrehvershinnikov po vsem indutsirovannym chislam reber, schweitzer 2004/2 miklos schweitzer 2004 extremal_graph_theory double_counting forbidden_clique goal_bound"}
{"id":"miklos-schweitzer-2004-p3-planar-embedding-edge-ratio","title":"Планарный граф с неизбежно большим отношением длин ребер, Schweitzer 2004/3","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2004-p3-planar-embedding-edge-ratio.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2004-p3-planar-embedding-edge-ratio.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2004-p3-planar-embedding-edge-ratio","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2004","tags":["planar_graphs","construction","induction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2004-p3-planar-embedding-edge-ratio планарный граф с неизбежно большим отношением длин ребер, schweitzer 2004/3 miklos schweitzer 2004 planar_graphs construction induction goal_construction miklos-schweitzer-2004-p3-planar-embedding-edge-ratio planarnyy graf s neizbezhno bolshim otnosheniem dlin reber, schweitzer 2004/3 miklos schweitzer 2004 planar_graphs construction induction goal_construction"}
{"id":"miklos-schweitzer-2005-p1-high-chromatic-defined-graph","title":"Явно заданные графы с произвольно большим хроматическим числом, Schweitzer 2005/1","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2005-p1-high-chromatic-defined-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2005-p1-high-chromatic-defined-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2005-p1-high-chromatic-defined-graph","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2005","tags":["coloring","extremal_graph_theory","goal_existence","ramsey_theory"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"agent_solution","search_text":"miklos-schweitzer-2005-p1-high-chromatic-defined-graph явно заданные графы с произвольно большим хроматическим числом, schweitzer 2005/1 miklos schweitzer 2005 coloring extremal_graph_theory goal_existence ramsey_theory miklos-schweitzer-2005-p1-high-chromatic-defined-graph yavno zadannye grafy s proizvolno bolshim hromaticheskim chislom, schweitzer 2005/1 miklos schweitzer 2005 coloring extremal_graph_theory goal_existence ramsey_theory"}
{"id":"miklos-schweitzer-2008-p3-tame-bipartite-graphs","title":"Максимальное число ребер в ручных двудольных графах, Schweitzer 2008/3","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2008-p3-tame-bipartite-graphs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2008-p3-tame-bipartite-graphs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2008-p3-tame-bipartite-graphs","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2008","tags":["extremal_graph_theory","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2008-p3-tame-bipartite-graphs максимальное число ребер в ручных двудольных графах, schweitzer 2008/3 miklos schweitzer 2008 extremal_graph_theory construction goal_exact_bound gábor tardos miklos-schweitzer-2008-p3-tame-bipartite-graphs maksimalnoe chislo reber v ruchnyh dvudolnyh grafah, schweitzer 2008/3 miklos schweitzer 2008 extremal_graph_theory construction goal_exact_bound gábor tardos"}
{"id":"miklos-schweitzer-2009-p1-k17-edge-coloring-cards","title":"Раскраски ребер полного графа на 17 вершинах и 15-вершинные клики, Miklos Schweitzer 2009 P1","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2009-p1-k17-edge-coloring-cards.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2009-p1-k17-edge-coloring-cards.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2009-p1-k17-edge-coloring-cards","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2009","tags":["coloring","extremal_graph_theory","goal_exact_bound","double_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2009-p1-k17-edge-coloring-cards раскраски ребер полного графа на 17 вершинах и 15-вершинные клики, miklos schweitzer 2009 p1 miklos miklos schweitzer 2009 coloring extremal_graph_theory goal_exact_bound double_counting andras gyarfas miklos-schweitzer-2009-p1-k17-edge-coloring-cards raskraski reber polnogo grafa na 17 vershinah i 15-vershinnye kliki, miklos schweitzer 2009 p1 miklos miklos schweitzer 2009 coloring extremal_graph_theory goal_exact_bound double_counting andras gyarfas"}
{"id":"miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path","title":"Путь как граф разностей с фиксированными простыми делителями, Miklos Schweitzer 2009 P2(ii)","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2009","tags":["graph_model","degree_counting","connectivity","construction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path путь как граф разностей с фиксированными простыми делителями, miklos schweitzer 2009 p2(ii) miklos miklos schweitzer 2009 graph_model degree_counting connectivity construction goal_existence miklos-schweitzer-2009-p2-bounded-degree-smooth-difference-path put kak graf raznostey s fiksirovannymi prostymi delitelyami, miklos schweitzer 2009 p2(ii) miklos miklos schweitzer 2009 graph_model degree_counting connectivity construction goal_existence"}
{"id":"miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible","title":"Невозможность полного графа разностей с фиксированными простыми делителями, Miklos Schweitzer 2009 P2(i)","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2009","tags":["graph_model","degree_counting","pigeonhole_principle","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible невозможность полного графа разностей с фиксированными простыми делителями, miklos schweitzer 2009 p2(i) miklos miklos schweitzer 2009 graph_model degree_counting pigeonhole_principle goal_impossibility miklos-schweitzer-2009-p2-complete-smooth-difference-graphs-impossible nevozmozhnost polnogo grafa raznostey s fiksirovannymi prostymi delitelyami, miklos schweitzer 2009 p2(i) miklos miklos schweitzer 2009 graph_model degree_counting pigeonhole_principle goal_impossibility"}
{"id":"miklos-schweitzer-2009-p2-smooth-difference-graphs","title":"Граф разностей с заданными простыми делителями, Miklos Schweitzer 2009 P2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2009-p2-smooth-difference-graphs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2009-p2-smooth-difference-graphs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2009-p2-smooth-difference-graphs","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2009","tags":["graph_model","connectivity","degree_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2009-p2-smooth-difference-graphs граф разностей с заданными простыми делителями, miklos schweitzer 2009 p2 miklos miklos schweitzer 2009 graph_model connectivity degree_counting goal_existence miklos-schweitzer-2009-p2-smooth-difference-graphs graf raznostey s zadannymi prostymi delitelyami, miklos schweitzer 2009 p2 miklos miklos schweitzer 2009 graph_model connectivity degree_counting goal_existence"}
{"id":"miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching","title":"Совершенное паросочетание в счетном вершинно-транзитивном графе, Miklos Schweitzer 2010 P2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2010","tags":["matching","connectivity","graph_symmetry","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching совершенное паросочетание в счетном вершинно-транзитивном графе, miklos schweitzer 2010 p2 miklos miklos schweitzer 2010 matching connectivity graph_symmetry goal_existence miklos-schweitzer-2010-p2-infinite-vertex-transitive-perfect-matching sovershennoe parosochetanie v schetnom vershinno-tranzitivnom grafe, miklos schweitzer 2010 p2 miklos miklos schweitzer 2010 matching connectivity graph_symmetry goal_existence"}
{"id":"miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph","title":"Большой одноцветный связный подграф при минимальной степени 3n/4, Miklos Schweitzer 2011 P2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2011","tags":["coloring","connectivity","degree_counting","cut_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph большой одноцветный связный подграф при минимальной степени 3n/4, miklos schweitzer 2011 p2 miklos miklos schweitzer 2011 coloring connectivity degree_counting cut_counting goal_existence miklos-schweitzer-2011-p2-min-degree-monochromatic-connected-subgraph bolshoy odnotsvetnyy svyaznyy podgraf pri minimalnoy stepeni 3n/4, miklos schweitzer 2011 p2 miklos miklos schweitzer 2011 coloring connectivity degree_counting cut_counting goal_existence"}
{"id":"miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees","title":"Черный граф диаграммы узла и число остовных деревьев, Miklos Schweitzer 2012 P10","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2012","tags":["planar_graphs","trees","goal_counting","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees черный граф диаграммы узла и число остовных деревьев, miklos schweitzer 2012 p10 miklos miklos schweitzer 2012 planar_graphs trees goal_counting goal_classification miklos-schweitzer-2012-p10-knot-black-graph-spanning-trees chernyy graf diagrammy uzla i chislo ostovnyh derevev, miklos schweitzer 2012 p10 miklos miklos schweitzer 2012 planar_graphs trees goal_counting goal_classification"}
{"id":"miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees","title":"Узлы с диаграммой, черный граф которой имеет не более трех остовных деревьев, Miklos Schweitzer 2012 P10(a)","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2012","tags":["planar_graphs","trees","goal_counting","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees узлы с диаграммой, черный граф которой имеет не более трех остовных деревьев, miklos schweitzer 2012 p10(a) miklos miklos schweitzer 2012 planar_graphs trees goal_counting goal_classification miklos-schweitzer-2012-p10a-knot-black-graph-at-most-three-spanning-trees uzly s diagrammoy, chernyy graf kotoroy imeet ne bolee treh ostovnyh derevev, miklos schweitzer 2012 p10(a) miklos miklos schweitzer 2012 planar_graphs trees goal_counting goal_classification"}
{"id":"miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees","title":"Нечетность числа остовных деревьев черного графа диаграммы узла, Miklos Schweitzer 2012 P10(b)","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2012","tags":["planar_graphs","trees","invariant","goal_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees нечетность числа остовных деревьев черного графа диаграммы узла, miklos schweitzer 2012 p10(b) miklos miklos schweitzer 2012 planar_graphs trees invariant goal_counting goal_proof stipsicz andrás miklos-schweitzer-2012-p10b-knot-black-graph-odd-spanning-trees nechetnost chisla ostovnyh derevev chernogo grafa diagrammy uzla, miklos schweitzer 2012 p10(b) miklos miklos schweitzer 2012 planar_graphs trees invariant goal_counting goal_proof stipsicz andrás"}
{"id":"miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree","title":"Одноцветное дерево на k вершинах в 2-раскрашенном k-хроматическом графе, Miklos Schweitzer 2012 P3","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2012","tags":["coloring","trees","connectivity","classical_lemma","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree одноцветное дерево на k вершинах в 2-раскрашенном k-хроматическом графе, miklos schweitzer 2012 p3 miklos miklos schweitzer 2012 coloring trees connectivity classical_lemma goal_existence miklos-schweitzer-2012-p3-two-colored-k-chromatic-tree odnotsvetnoe derevo na k vershinah v 2-raskrashennom k-hromaticheskom grafe, miklos schweitzer 2012 p3 miklos miklos schweitzer 2012 coloring trees connectivity classical_lemma goal_existence"}
{"id":"miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets","title":"Триангуляция сферы и четыре пересекающихся выпуклых множества, Miklos Schweitzer 2014 P10","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2014","tags":["planar_graphs","graph_model","classical_theorem","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets триангуляция сферы и четыре пересекающихся выпуклых множества, miklos schweitzer 2014 p10 miklos miklos schweitzer 2014 planar_graphs graph_model classical_theorem goal_existence frenkel péter kós géza miklos-schweitzer-2014-p10-sphere-triangulation-convex-sets triangulyatsiya sfery i chetyre peresekayuschihsya vypuklyh mnozhestva, miklos schweitzer 2014 p10 miklos miklos schweitzer 2014 planar_graphs graph_model classical_theorem goal_existence frenkel péter kós géza"}
{"id":"miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring","title":"Граф видимости точек Ван дер Корпута прямоугольниками, Miklos Schweitzer 2015 P2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2015","tags":["coloring","graph_model","goal_bound","construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring граф видимости точек ван дер корпута прямоугольниками, miklos schweitzer 2015 p2 miklos miklos schweitzer 2015 coloring graph_model goal_bound construction gábor tardos miklos-schweitzer-2015-p2-van-der-corput-rectangle-graph-coloring graf vidimosti tochek van der korputa pryamougolnikami, miklos schweitzer 2015 p2 miklos miklos schweitzer 2015 coloring graph_model goal_bound construction gábor tardos"}
{"id":"miklos-schweitzer-2015-p3-relation-minimal-dominating-set","title":"Минимальное доминирующее множество в ориентированном отношении, Miklos Schweitzer 2015 P3","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2015-p3-relation-minimal-dominating-set.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2015-p3-relation-minimal-dominating-set.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2015-p3-relation-minimal-dominating-set","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2015","tags":["graph_model","minimal_counterexample","goal_bound","connectivity"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2015-p3-relation-minimal-dominating-set минимальное доминирующее множество в ориентированном отношении, miklos schweitzer 2015 p3 miklos miklos schweitzer 2015 graph_model minimal_counterexample goal_bound connectivity lászló zádori miklos-schweitzer-2015-p3-relation-minimal-dominating-set minimalnoe dominiruyuschee mnozhestvo v orientirovannom otnoshenii, miklos schweitzer 2015 p3 miklos miklos schweitzer 2015 graph_model minimal_counterexample goal_bound connectivity lászló zádori"}
{"id":"miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels","title":"Метки ребер полного графа и коллинеарность на треугольниках, Miklos Schweitzer 2016 P2","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels","source_key":"miklos","source_keys":["miklos"],"source_label":"Miklos Schweitzer","year":"2016","tags":["graph_model","connectivity","coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"external_theorem_application","search_text":"miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels метки ребер полного графа и коллинеарность на треугольниках, miklos schweitzer 2016 p2 miklos miklos schweitzer 2016 graph_model connectivity coloring goal_proof miklos-schweitzer-2016-p2-complete-graph-collinear-edge-labels metki reber polnogo grafa i kollinearnost na treugolnikah, miklos schweitzer 2016 p2 miklos miklos schweitzer 2016 graph_model connectivity coloring goal_proof"}
{"id":"miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side","title":"Разбиение квадрата на треугольники без общей стороны, Schweitzer 2017 P1","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2017","tags":["planar_graphs","double_counting","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side разбиение квадрата на треугольники без общей стороны, schweitzer 2017 p1 miklos schweitzer 2017 planar_graphs double_counting goal_impossibility miklos-schweitzer-2017-p1-triangle-tiling-no-shared-side razbienie kvadrata na treugolniki bez obschey storony, schweitzer 2017 p1 miklos schweitzer 2017 planar_graphs double_counting goal_impossibility"}
{"id":"miklos-schweitzer-2018-p1-continuous-graph-countable-coloring","title":"Граф, заданный непрерывной функцией, имеет счетную раскраску, Schweitzer 2018 P1","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2018-p1-continuous-graph-countable-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2018-p1-continuous-graph-countable-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2018-p1-continuous-graph-countable-coloring","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2018","tags":["coloring","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"miklos-schweitzer-2018-p1-continuous-graph-countable-coloring граф, заданный непрерывной функцией, имеет счетную раскраску, schweitzer 2018 p1 miklos schweitzer 2018 coloring graph_model goal_bound miklos-schweitzer-2018-p1-continuous-graph-countable-coloring graf, zadannyy nepreryvnoy funktsiey, imeet schetnuyu raskrasku, schweitzer 2018 p1 miklos schweitzer 2018 coloring graph_model goal_bound"}
{"id":"miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings","title":"Хорошие матрицы и шеллинги полного двудольного графа, Schweitzer 2019 P4","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2019","tags":["induction","graph_model","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings хорошие матрицы и шеллинги полного двудольного графа, schweitzer 2019 p4 miklos schweitzer 2019 induction graph_model goal_counting miklos-schweitzer-2019-p4-nice-matrices-bipartite-shellings horoshie matritsy i shellingi polnogo dvudolnogo grafa, schweitzer 2019 p4 miklos schweitzer 2019 induction graph_model goal_counting"}
{"id":"miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph","title":"Кривые из начала координат и пары осевых отрезков, Schweitzer 2020 P4","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2020","tags":["planar_graphs","graph_in_solution","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph кривые из начала координат и пары осевых отрезков, schweitzer 2020 p4 miklos schweitzer 2020 planar_graphs graph_in_solution goal_bound eyal ackerman, balázs keszegh, dömötör pálvölgyi miklos-schweitzer-2020-p4-axis-parallel-segments-curves-planar-graph krivye iz nachala koordinat i pary osevyh otrezkov, schweitzer 2020 p4 miklos schweitzer 2020 planar_graphs graph_in_solution goal_bound eyal ackerman, balázs keszegh, dömötör pálvölgyi"}
{"id":"miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights","title":"Веса ребер, минимумы и максимумы дают совершенные паросочетания, Schweitzer 2024 P1","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2024","tags":["matching","construction","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights веса ребер, минимумы и максимумы дают совершенные паросочетания, schweitzer 2024 p1 miklos schweitzer 2024 matching construction goal_existence kristóf bérczi miklos-schweitzer-2024-p1-bipartite-perfect-matching-edge-weights vesa reber, minimumy i maksimumy dayut sovershennye parosochetaniya, schweitzer 2024 p1 miklos schweitzer 2024 matching construction goal_existence kristóf bérczi"}
{"id":"miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection","title":"Окружности для вершин двудольного планарного графа, Schweitzer 2024 P8","path":"data\\problems\\miklos-schweitzer\\miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/miklos-schweitzer/miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection","source_key":"miklos","source_keys":["miklos"],"source_label":"Schweitzer","year":"2024","tags":["planar_graphs","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection окружности для вершин двудольного планарного графа, schweitzer 2024 p8 miklos schweitzer 2024 planar_graphs graph_model goal_existence damásdi gábor miklos-schweitzer-2024-p8-bipartite-planar-circle-contact-intersection okruzhnosti dlya vershin dvudolnogo planarnogo grafa, schweitzer 2024 p8 miklos schweitzer 2024 planar_graphs graph_model goal_existence damásdi gábor"}
{"id":"min-degree-common-neighborhood-clique","title":"Клика из большой минимальной степени через общих соседей","path":"data\\problems\\classical\\min-degree-common-neighborhood-clique.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/min-degree-common-neighborhood-clique.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#min-degree-common-neighborhood-clique","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","forbidden_clique","degree_counting","double_counting","classical_lemma","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"min-degree-common-neighborhood-clique клика из большой минимальной степени через общих соседей misc прочее extremal_graph_theory forbidden_clique degree_counting double_counting classical_lemma goal_proof min-degree-common-neighborhood-clique klika iz bolshoy minimalnoy stepeni cherez obschih sosedey misc prochee extremal_graph_theory forbidden_clique degree_counting double_counting classical_lemma goal_proof"}
{"id":"minimal-half-subset-exchange-lemma","title":"Лемма об обмене для подмножества с минимальным числом внутренних ребер","path":"data\\problems\\classical\\minimal-half-subset-exchange-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/minimal-half-subset-exchange-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#minimal-half-subset-exchange-lemma","source_key":"misc","source_keys":["misc","cmo"],"source_label":"Прочее","year":"","tags":["extremal_choice","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"minimal-half-subset-exchange-lemma лемма об обмене для подмножества с минимальным числом внутренних ребер misc прочее extremal_choice goal_bound canadian mathematical society minimal-half-subset-exchange-lemma lemma ob obmene dlya podmnozhestva s minimalnym chislom vnutrennih reber misc prochee extremal_choice goal_bound canadian mathematical society"}
{"id":"mmo-2008-athletes-arbiters-photos","title":"Спортсмены, арбитры и фотографии после турнира, ММО 2008","path":"data\\problems\\mmo\\mmo-2008-athletes-arbiters-photos.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2008-athletes-arbiters-photos.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2008-athletes-arbiters-photos","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2008","tags":["degree_counting","graph_in_solution","goal_classification","construction","goal_exact_bound"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"mmo-2008-athletes-arbiters-photos спортсмены, арбитры и фотографии после турнира, ммо 2008 mmo ммо 2008 degree_counting graph_in_solution goal_classification construction goal_exact_bound френкин б.р. mmo-2008-athletes-arbiters-photos sportsmeny, arbitry i fotografii posle turnira, mmo 2008 mmo mmo 2008 degree_counting graph_in_solution goal_classification construction goal_exact_bound frenkin b.r."}
{"id":"mmo-2010-unit-distance-segments","title":"Единичные отрезки между 4n точками, ММО 2010","path":"data\\problems\\mmo\\mmo-2010-unit-distance-segments.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2010-unit-distance-segments.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2010-unit-distance-segments","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2010","tags":["graph_model","extremal_graph_theory","degree_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution","search_text":"mmo-2010-unit-distance-segments единичные отрезки между 4n точками, ммо 2010 mmo ммо 2010 graph_model extremal_graph_theory degree_counting а. м. райгородский mmo-2010-unit-distance-segments edinichnye otrezki mezhdu 4n tochkami, mmo 2010 mmo mmo 2010 graph_model extremal_graph_theory degree_counting a. m. raygorodskiy"}
{"id":"mmo-2011-firms-programmers-geniuses","title":"Стратегия второй фирмы при найме программистов и четырёх гениев, ММО 2011","path":"data\\problems\\mmo\\mmo-2011-firms-programmers-geniuses.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2011-firms-programmers-geniuses.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2011-firms-programmers-geniuses","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2011","tags":["graph_model","goal_strategy_game","connectivity"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"mmo-2011-firms-programmers-geniuses стратегия второй фирмы при найме программистов и четырёх гениев, ммо 2011 mmo ммо 2011 graph_model goal_strategy_game connectivity шаповалов а.в. mmo-2011-firms-programmers-geniuses strategiya vtoroy firmy pri nayme programmistov i chetyreh geniev, mmo 2011 mmo mmo 2011 graph_model goal_strategy_game connectivity shapovalov a.v."}
{"id":"mmo-2012-three-subsets-coloring","title":"Раскраска графа на тройках из 2^k элементов, ММО 2012","path":"data\\problems\\mmo\\mmo-2012-three-subsets-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2012-three-subsets-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2012-three-subsets-coloring","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2012","tags":["coloring","extremal_graph_theory","graph_model","goal_exact_bound","construction","induction","modular_coloring"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"mmo-2012-three-subsets-coloring раскраска графа на тройках из 2^k элементов, ммо 2012 mmo ммо 2012 coloring extremal_graph_theory graph_model goal_exact_bound construction induction modular_coloring а. м. райгородский mmo-2012-three-subsets-coloring raskraska grafa na troykah iz 2^k elementov, mmo 2012 mmo mmo 2012 coloring extremal_graph_theory graph_model goal_exact_bound construction induction modular_coloring a. m. raygorodskiy"}
{"id":"mmo-2016-linguists-kneser-edge-bound","title":"Лингвисты, три языка и нижняя оценка числа ребер в подграфе Кнезера, ММО 2015/16","path":"data\\problems\\mmo\\mmo-2016-linguists-kneser-edge-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2016-linguists-kneser-edge-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2016-linguists-kneser-edge-bound","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2016","tags":["extremal_graph_theory","degree_counting","graph_model","double_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"mmo-2016-linguists-kneser-edge-bound лингвисты, три языка и нижняя оценка числа ребер в подграфе кнезера, ммо 2015/16 mmo ммо 2016 extremal_graph_theory degree_counting graph_model double_counting а. м. райгородский mmo-2016-linguists-kneser-edge-bound lingvisty, tri yazyka i nizhnyaya otsenka chisla reber v podgrafe knezera, mmo 2015/16 mmo mmo 2016 extremal_graph_theory degree_counting graph_model double_counting a. m. raygorodskiy"}
{"id":"mmo-2018-acquaintance-seating-clique-chromatic","title":"Рассадка 2018 участников и кликовое хроматическое число, ММО 2017/18","path":"data\\problems\\mmo\\mmo-2018-acquaintance-seating-clique-chromatic.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2018-acquaintance-seating-clique-chromatic.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2018-acquaintance-seating-clique-chromatic","source_key":"mmo","source_keys":["mmo"],"source_label":"Рассадка","year":"2018","tags":["coloring","graph_model","induction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_solution","search_text":"mmo-2018-acquaintance-seating-clique-chromatic рассадка 2018 участников и кликовое хроматическое число, ммо 2017/18 mmo рассадка 2018 coloring graph_model induction mmo-2018-acquaintance-seating-clique-chromatic rassadka 2018 uchastnikov i klikovoe hromaticheskoe chislo, mmo 2017/18 mmo rassadka 2018 coloring graph_model induction"}
{"id":"mmo-2020-one-way-roads-acyclic-tournament","title":"Односторонние дороги между 32 городами, ММО 2020/21, 8 класс, задача 6","path":"data\\problems\\mmo\\mmo-2020-one-way-roads-acyclic-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2020-one-way-roads-acyclic-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2020-one-way-roads-acyclic-tournament","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2020","tags":["tournaments","graph_model","induction","dynamics","extremal_choice"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"mmo-2020-one-way-roads-acyclic-tournament односторонние дороги между 32 городами, ммо 2020/21, 8 класс, задача 6 mmo ммо 2020 tournaments graph_model induction dynamics extremal_choice заславский а.а. mmo-2020-one-way-roads-acyclic-tournament odnostoronnie dorogi mezhdu 32 gorodami, mmo 2020/21, 8 klass, zadacha 6 mmo mmo 2020 tournaments graph_model induction dynamics extremal_choice zaslavskiy a.a."}
{"id":"mmo-2023-hypergraph-club-acquaintance-graph","title":"Клуб гиперграфов: минимум школьников при 100 заседаниях и условии на знакомства, ММО 2023/24, 10 класс, задача 3","path":"data\\problems\\mmo\\mmo-2023-hypergraph-club-acquaintance-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2023-hypergraph-club-acquaintance-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2023-hypergraph-club-acquaintance-graph","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2023","tags":["graph_model","degree_counting","double_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"mmo-2023-hypergraph-club-acquaintance-graph клуб гиперграфов: минимум школьников при 100 заседаниях и условии на знакомства, ммо 2023/24, 10 класс, задача 3 mmo ммо 2023 graph_model degree_counting double_counting construction goal_exact_bound д. метелев mmo-2023-hypergraph-club-acquaintance-graph klub gipergrafov: minimum shkolnikov pri 100 zasedaniyah i uslovii na znakomstva, mmo 2023/24, 10 klass, zadacha 3 mmo mmo 2023 graph_model degree_counting double_counting construction goal_exact_bound d. metelev"}
{"id":"mmo-2024-symposium-acquaintance-lies","title":"Симпозиум лжецов и правдолюбов: ответы о знакомстве, ММО 2024/25, 11 класс, задача 1","path":"data\\problems\\mmo\\mmo-2024-symposium-acquaintance-lies.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/mmo/mmo-2024-symposium-acquaintance-lies.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#mmo-2024-symposium-acquaintance-lies","source_key":"mmo","source_keys":["mmo"],"source_label":"ММО","year":"2024","tags":["graph_model","graph_symmetry","double_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"mmo-2024-symposium-acquaintance-lies симпозиум лжецов и правдолюбов: ответы о знакомстве, ммо 2024/25, 11 класс, задача 1 mmo ммо 2024 graph_model graph_symmetry double_counting construction goal_exact_bound евдокимов м.а. mmo-2024-symposium-acquaintance-lies simpozium lzhetsov i pravdolyubov: otvety o znakomstve, mmo 2024/25, 11 klass, zadacha 1 mmo mmo 2024 graph_model graph_symmetry double_counting construction goal_exact_bound evdokimov m.a."}
{"id":"no-isolated-vertices-edge-lower-bound","title":"Лемма о нижней оценке числа рёбер при почти отсутствии изолированных вершин","path":"data\\problems\\classical\\no-isolated-vertices-edge-lower-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/no-isolated-vertices-edge-lower-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#no-isolated-vertices-edge-lower-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","double_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"no-isolated-vertices-edge-lower-bound лемма о нижней оценке числа рёбер при почти отсутствии изолированных вершин misc прочее extremal_graph_theory double_counting goal_bound no-isolated-vertices-edge-lower-bound lemma o nizhney otsenke chisla reber pri pochti otsutstvii izolirovannyh vershin misc prochee extremal_graph_theory double_counting goal_bound"}
{"id":"no-two-color-cycle-edge-bound","title":"Оценка числа рёбер при отсутствии двухцветных циклов","path":"data\\problems\\classical\\no-two-color-cycle-edge-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/no-two-color-cycle-edge-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#no-two-color-cycle-edge-bound","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["coloring","trees","extremal_graph_theory","goal_bound","double_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"no-two-color-cycle-edge-bound оценка числа рёбер при отсутствии двухцветных циклов misc прочее coloring trees extremal_graph_theory goal_bound double_counting no-two-color-cycle-edge-bound otsenka chisla reber pri otsutstvii dvuhtsvetnyh tsiklov misc prochee coloring trees extremal_graph_theory goal_bound double_counting"}
{"id":"ore-theorem","title":"Теорема Оре о гамильтоновом цикле по суммам степеней","path":"data\\problems\\classical\\ore-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ore-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ore-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["hamiltonian_cycles","extremal_choice","minimal_counterexample","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ore-theorem теорема оре о гамильтоновом цикле по суммам степеней misc прочее hamiltonian_cycles extremal_choice minimal_counterexample classical_theorem goal_exact_bound øystein ore ore-theorem teorema ore o gamiltonovom tsikle po summam stepeney misc prochee hamiltonian_cycles extremal_choice minimal_counterexample classical_theorem goal_exact_bound øystein ore"}
{"id":"pairwise-intersecting-edges-star-or-triangle","title":"Попарно пересекающиеся рёбра: звезда или треугольник","path":"data\\problems\\classical\\pairwise-intersecting-edges-star-or-triangle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/pairwise-intersecting-edges-star-or-triangle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#pairwise-intersecting-edges-star-or-triangle","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"pairwise-intersecting-edges-star-or-triangle попарно пересекающиеся рёбра: звезда или треугольник misc прочее extremal_graph_theory goal_characterization шаповалов а.в. pairwise-intersecting-edges-star-or-triangle poparno peresekayuschiesya rebra: zvezda ili treugolnik misc prochee extremal_graph_theory goal_characterization shapovalov a.v."}
{"id":"planar-edge-bound","title":"Оценка числа рёбер в простом планарном графе","path":"data\\problems\\classical\\planar-edge-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/planar-edge-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#planar-edge-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","double_counting","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"planar-edge-bound оценка числа рёбер в простом планарном графе misc прочее planar_graphs double_counting classical_theorem goal_exact_bound planar-edge-bound otsenka chisla reber v prostom planarnom grafe misc prochee planar_graphs double_counting classical_theorem goal_exact_bound"}
{"id":"planar-large-girth-degree-two-chain","title":"В планарном графе большого обхвата есть длинная цепочка вершин степени 2","path":"data\\problems\\classical\\planar-large-girth-degree-two-chain.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/planar-large-girth-degree-two-chain.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#planar-large-girth-degree-two-chain","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","extremal_graph_theory","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"planar-large-girth-degree-two-chain в планарном графе большого обхвата есть длинная цепочка вершин степени 2 misc прочее planar_graphs extremal_graph_theory goal_existence planar-large-girth-degree-two-chain v planarnom grafe bolshogo obhvata est dlinnaya tsepochka vershin stepeni 2 misc prochee planar_graphs extremal_graph_theory goal_existence"}
{"id":"planar-large-girth-degree-two-path","title":"Длинный 2-путь в планарном графе большого обхвата","path":"data\\problems\\classical\\planar-large-girth-degree-two-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/planar-large-girth-degree-two-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#planar-large-girth-degree-two-path","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","classical_theorem","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"planar-large-girth-degree-two-path длинный 2-путь в планарном графе большого обхвата misc прочее planar_graphs classical_theorem double_counting goal_existence planar-large-girth-degree-two-path dlinnyy 2-put v planarnom grafe bolshogo obhvata misc prochee planar_graphs classical_theorem double_counting goal_existence"}
{"id":"polish-mo-2022-ii-p6-badminton-euler-cycles","title":"Аннулирование половины матчей через эйлеровы циклы, Польская MO 2022 II/6","path":"data\\problems\\polish-mo\\polish-mo-2022-ii-p6-badminton-euler-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/polish-mo/polish-mo-2022-ii-p6-badminton-euler-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#polish-mo-2022-ii-p6-badminton-euler-cycles","source_key":"polish","source_keys":["polish"],"source_label":"Польская MO","year":"2022","tags":["eulerian_graphs","degree_counting","graph_model","goal_existence"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"polish-mo-2022-ii-p6-badminton-euler-cycles аннулирование половины матчей через эйлеровы циклы, польская mo 2022 ii/6 polish польская mo 2022 eulerian_graphs degree_counting graph_model goal_existence polish-mo-2022-ii-p6-badminton-euler-cycles annulirovanie poloviny matchey cherez eylerovy tsikly, polskaya mo 2022 ii/6 polish polskaya mo 2022 eulerian_graphs degree_counting graph_model goal_existence"}
{"id":"polish-mo-2022-iii-p3-robust-chord-graph-sparsification","title":"Разрежение графа, остающегося связным после удаления 2021 рёбер, Польская MO 2022 III/3","path":"data\\problems\\polish-mo\\polish-mo-2022-iii-p3-robust-chord-graph-sparsification.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/polish-mo/polish-mo-2022-iii-p3-robust-chord-graph-sparsification.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#polish-mo-2022-iii-p3-robust-chord-graph-sparsification","source_key":"polish","source_keys":["polish"],"source_label":"остающегося связным после удаления","year":"2022","tags":["connectivity","trees","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"polish-mo-2022-iii-p3-robust-chord-graph-sparsification разрежение графа, остающегося связным после удаления 2021 рёбер, польская mo 2022 iii/3 polish остающегося связным после удаления 2022 connectivity trees graph_model goal_bound wojciech nadara polish-mo-2022-iii-p3-robust-chord-graph-sparsification razrezhenie grafa, ostayuschegosya svyaznym posle udaleniya 2021 reber, polskaya mo 2022 iii/3 polish ostayuschegosya svyaznym posle udaleniya 2022 connectivity trees graph_model goal_bound wojciech nadara"}
{"id":"protected-color-recoloring-lemma","title":"Лемма о защищённых цветах и устранении одноточечных классов","path":"data\\problems\\classical\\protected-color-recoloring-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/protected-color-recoloring-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#protected-color-recoloring-lemma","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["coloring","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"protected-color-recoloring-lemma лемма о защищённых цветах и устранении одноточечных классов misc прочее coloring goal_existence protected-color-recoloring-lemma lemma o zaschischennyh tsvetah i ustranenii odnotochechnyh klassov misc prochee coloring goal_existence"}
{"id":"putnam-1988-a4-unit-distance-coloring","title":"Раскраска плоскости и точки на расстоянии 1, Putnam 1988 A4","path":"data\\problems\\putnam\\putnam-1988-a4-unit-distance-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-1988-a4-unit-distance-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-1988-a4-unit-distance-coloring","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"1988","tags":["coloring","construction","goal_exact_bound","pigeonhole_principle"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-1988-a4-unit-distance-coloring раскраска плоскости и точки на расстоянии 1, putnam 1988 a4 putnam putnam 1988 coloring construction goal_exact_bound pigeonhole_principle putnam-1988-a4-unit-distance-coloring raskraska ploskosti i tochki na rasstoyanii 1, putnam 1988 a4 putnam putnam 1988 coloring construction goal_exact_bound pigeonhole_principle"}
{"id":"putnam-1990-b4-cayley-euler-tour","title":"Двойной обход элементов группы в графе Кэли, Putnam 1990 B4","path":"data\\problems\\putnam\\putnam-1990-b4-cayley-euler-tour.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-1990-b4-cayley-euler-tour.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-1990-b4-cayley-euler-tour","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"1990","tags":["eulerian_graphs","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-1990-b4-cayley-euler-tour двойной обход элементов группы в графе кэли, putnam 1990 b4 putnam putnam 1990 eulerian_graphs graph_model goal_existence putnam-1990-b4-cayley-euler-tour dvoynoy obhod elementov gruppy v grafe keli, putnam 1990 b4 putnam putnam 1990 eulerian_graphs graph_model goal_existence"}
{"id":"putnam-1994-a3-threshold-distance-coloring","title":"Четыре цвета на равнобедренном прямоугольном треугольнике, Putnam 1994 A3","path":"data\\problems\\putnam\\putnam-1994-a3-threshold-distance-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-1994-a3-threshold-distance-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-1994-a3-threshold-distance-coloring","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"1994","tags":["coloring","graph_model","goal_proof","pigeonhole_principle"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-1994-a3-threshold-distance-coloring четыре цвета на равнобедренном прямоугольном треугольнике, putnam 1994 a3 putnam putnam 1994 coloring graph_model goal_proof pigeonhole_principle putnam-1994-a3-threshold-distance-coloring chetyre tsveta na ravnobedrennom pryamougolnom treugolnike, putnam 1994 a3 putnam putnam 1994 coloring graph_model goal_proof pigeonhole_principle"}
{"id":"putnam-1996-a3-course-hypergraph","title":"Выборы курсов как 3-гиперграф, Putnam 1996 A3","path":"data\\problems\\putnam\\putnam-1996-a3-course-hypergraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-1996-a3-course-hypergraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-1996-a3-course-hypergraph","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"1996","tags":["construction","double_counting","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-1996-a3-course-hypergraph выборы курсов как 3-гиперграф, putnam 1996 a3 putnam putnam 1996 construction double_counting goal_impossibility putnam-1996-a3-course-hypergraph vybory kursov kak 3-gipergraf, putnam 1996 a3 putnam putnam 1996 construction double_counting goal_impossibility"}
{"id":"putnam-1996-a4-oriented-triples-order","title":"Ориентированные тройки и линейный порядок, Putnam 1996 A4","path":"data\\problems\\putnam\\putnam-1996-a4-oriented-triples-order.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-1996-a4-oriented-triples-order.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-1996-a4-oriented-triples-order","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"1996","tags":["tournaments","goal_existence","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-1996-a4-oriented-triples-order ориентированные тройки и линейный порядок, putnam 1996 a4 putnam putnam 1996 tournaments goal_existence goal_characterization putnam-1996-a4-oriented-triples-order orientirovannye troyki i lineynyy poryadok, putnam 1996 a4 putnam putnam 1996 tournaments goal_existence goal_characterization"}
{"id":"putnam-2002-b2-polyhedron-face-game-four-edge-face","title":"Игра на гранях полиэдра и грань с четырьмя сторонами, Putnam 2002 B2","path":"data\\problems\\putnam\\putnam-2002-b2-polyhedron-face-game-four-edge-face.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2002-b2-polyhedron-face-game-four-edge-face.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2002-b2-polyhedron-face-game-four-edge-face","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2002","tags":["planar_graphs","degree_counting","goal_strategy_game","double_counting"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2002-b2-polyhedron-face-game-four-edge-face игра на гранях полиэдра и грань с четырьмя сторонами, putnam 2002 b2 putnam putnam 2002 planar_graphs degree_counting goal_strategy_game double_counting putnam-2002-b2-polyhedron-face-game-four-edge-face igra na granyah poliedra i gran s chetyrmya storonami, putnam 2002 b2 putnam putnam 2002 planar_graphs degree_counting goal_strategy_game double_counting"}
{"id":"putnam-2004-a5-random-checkerboard-components","title":"Случайная раскраска доски и монохромные компоненты, Putnam 2004 A5","path":"data\\problems\\putnam\\putnam-2004-a5-random-checkerboard-components.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2004-a5-random-checkerboard-components.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2004-a5-random-checkerboard-components","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2004","tags":["connectivity","double_counting","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2004-a5-random-checkerboard-components случайная раскраска доски и монохромные компоненты, putnam 2004 a5 putnam putnam 2004 connectivity double_counting graph_model goal_bound putnam-2004-a5-random-checkerboard-components sluchaynaya raskraska doski i monohromnye komponenty, putnam 2004 a5 putnam putnam 2004 connectivity double_counting graph_model goal_bound"}
{"id":"putnam-2005-a2-rook-tours-grid-hamiltonian-paths","title":"Ладейные обходы прямоугольника 3 на n, Putnam 2005 A2","path":"data\\problems\\putnam\\putnam-2005-a2-rook-tours-grid-hamiltonian-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2005-a2-rook-tours-grid-hamiltonian-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2005-a2-rook-tours-grid-hamiltonian-paths","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2005","tags":["graph_model","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2005-a2-rook-tours-grid-hamiltonian-paths ладейные обходы прямоугольника 3 на n, putnam 2005 a2 putnam putnam 2005 graph_model goal_counting putnam-2005-a2-rook-tours-grid-hamiltonian-paths ladeynye obhody pryamougolnika 3 na n, putnam 2005 a2 putnam putnam 2005 graph_model goal_counting"}
{"id":"putnam-2007-a6-admissible-triangulation-bound","title":"Допустимая триангуляция многоугольника с внутренними степенями не меньше 6, Putnam 2007 A6","path":"data\\problems\\putnam\\putnam-2007-a6-admissible-triangulation-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2007-a6-admissible-triangulation-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2007-a6-admissible-triangulation-bound","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2007","tags":["planar_graphs","degree_counting","induction","goal_bound","double_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2007-a6-admissible-triangulation-bound допустимая триангуляция многоугольника с внутренними степенями не меньше 6, putnam 2007 a6 putnam putnam 2007 planar_graphs degree_counting induction goal_bound double_counting putnam-2007-a6-admissible-triangulation-bound dopustimaya triangulyatsiya mnogougolnika s vnutrennimi stepenyami ne menshe 6, putnam 2007 a6 putnam putnam 2007 planar_graphs degree_counting induction goal_bound double_counting"}
{"id":"putnam-2012-b3-round-robin-winners-hall","title":"Выбор победителя каждого дня в круговом турнире, Putnam 2012 B3","path":"data\\problems\\putnam\\putnam-2012-b3-round-robin-winners-hall.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2012-b3-round-robin-winners-hall.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2012-b3-round-robin-winners-hall","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2012","tags":["matching","tournaments","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2012-b3-round-robin-winners-hall выбор победителя каждого дня в круговом турнире, putnam 2012 b3 putnam putnam 2012 matching tournaments graph_model goal_existence putnam-2012-b3-round-robin-winners-hall vybor pobeditelya kazhdogo dnya v krugovom turnire, putnam 2012 b3 putnam putnam 2012 matching tournaments graph_model goal_existence"}
{"id":"putnam-2013-a1-icosahedron-face-labels","title":"Две грани икосаэдра с общей вершиной и одинаковой меткой, Putnam 2013 A1","path":"data\\problems\\putnam\\putnam-2013-a1-icosahedron-face-labels.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2013-a1-icosahedron-face-labels.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2013-a1-icosahedron-face-labels","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2013","tags":["double_counting","pigeonhole_principle","graph_model","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2013-a1-icosahedron-face-labels две грани икосаэдра с общей вершиной и одинаковой меткой, putnam 2013 a1 putnam putnam 2013 double_counting pigeonhole_principle graph_model goal_proof putnam-2013-a1-icosahedron-face-labels dve grani ikosaedra s obschey vershinoy i odinakovoy metkoy, putnam 2013 a1 putnam putnam 2013 double_counting pigeonhole_principle graph_model goal_proof"}
{"id":"putnam-2013-b5-functions-iterate-into-roots","title":"Функции, итерации которых попадают в первые k точек, Putnam 2013 B5","path":"data\\problems\\putnam\\putnam-2013-b5-functions-iterate-into-roots.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2013-b5-functions-iterate-into-roots.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2013-b5-functions-iterate-into-roots","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2013","tags":["trees","graph_model","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2013-b5-functions-iterate-into-roots функции, итерации которых попадают в первые k точек, putnam 2013 b5 putnam putnam 2013 trees graph_model goal_counting putnam-2013-b5-functions-iterate-into-roots funktsii, iteratsii kotoryh popadayut v pervye k tochek, putnam 2013 b5 putnam putnam 2013 trees graph_model goal_counting"}
{"id":"putnam-2014-b3-prime-entries-bipartite-cycle","title":"Простые элементы рациональной матрицы, Putnam 2014 B3","path":"data\\problems\\putnam\\putnam-2014-b3-prime-entries-bipartite-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2014-b3-prime-entries-bipartite-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2014-b3-prime-entries-bipartite-cycle","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2014","tags":["connectivity","graph_in_solution","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2014-b3-prime-entries-bipartite-cycle простые элементы рациональной матрицы, putnam 2014 b3 putnam putnam 2014 connectivity graph_in_solution goal_proof putnam-2014-b3-prime-entries-bipartite-cycle prostye elementy ratsionalnoy matritsy, putnam 2014 b3 putnam putnam 2014 connectivity graph_in_solution goal_proof"}
{"id":"putnam-2016-a5-cayley-digraph-short-words","title":"Короткие слова в двух порождающих через граф Кэли, Putnam 2016 A5","path":"data\\problems\\putnam\\putnam-2016-a5-cayley-digraph-short-words.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2016-a5-cayley-digraph-short-words.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2016-a5-cayley-digraph-short-words","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2016","tags":["connectivity","graph_model","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2016-a5-cayley-digraph-short-words короткие слова в двух порождающих через граф кэли, putnam 2016 a5 putnam putnam 2016 connectivity graph_model goal_proof putnam-2016-a5-cayley-digraph-short-words korotkie slova v dvuh porozhdayuschih cherez graf keli, putnam 2016 a5 putnam putnam 2016 connectivity graph_model goal_proof"}
{"id":"putnam-2017-a6-icosahedron-edge-colorings","title":"Раскраски рёбер икосаэдра тремя цветами, Putnam 2017 A6","path":"data\\problems\\putnam\\putnam-2017-a6-icosahedron-edge-colorings.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2017-a6-icosahedron-edge-colorings.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2017-a6-icosahedron-edge-colorings","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2017","tags":["coloring","planar_graphs","graph_model","modular_coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"putnam-2017-a6-icosahedron-edge-colorings раскраски рёбер икосаэдра тремя цветами, putnam 2017 a6 putnam putnam 2017 coloring planar_graphs graph_model modular_coloring goal_counting putnam-2017-a6-icosahedron-edge-colorings raskraski reber ikosaedra tremya tsvetami, putnam 2017 a6 putnam putnam 2017 coloring planar_graphs graph_model modular_coloring goal_counting"}
{"id":"putnam-2021-b5-very-odd-matrices-dag","title":"«Очень нечётные» матрицы и ациклический ориентированный граф, Putnam 2021 B5","path":"data\\problems\\putnam\\putnam-2021-b5-very-odd-matrices-dag.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2021-b5-very-odd-matrices-dag.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2021-b5-very-odd-matrices-dag","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2021","tags":["connectivity","graph_model","induction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"putnam-2021-b5-very-odd-matrices-dag «очень нечётные» матрицы и ациклический ориентированный граф, putnam 2021 b5 putnam putnam 2021 connectivity graph_model induction goal_proof putnam-2021-b5-very-odd-matrices-dag «ochen nechetnye» matritsy i atsiklicheskiy orientirovannyy graf, putnam 2021 b5 putnam putnam 2021 connectivity graph_model induction goal_proof"}
{"id":"putnam-2025-a3-ternary-string-game-perfect-matching","title":"Игра на троичных строках, Putnam 2025 A3","path":"data\\problems\\putnam\\putnam-2025-a3-ternary-string-game-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2025-a3-ternary-string-game-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2025-a3-ternary-string-game-perfect-matching","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2025","tags":["matching","graph_model","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"putnam-2025-a3-ternary-string-game-perfect-matching игра на троичных строках, putnam 2025 a3 putnam putnam 2025 matching graph_model goal_strategy_game putnam-2025-a3-ternary-string-game-perfect-matching igra na troichnyh strokah, putnam 2025 a3 putnam putnam 2025 matching graph_model goal_strategy_game"}
{"id":"putnam-2025-a4-cycle-commutation-graph-matrices","title":"Цикл как граф коммутирования матриц минимальной размерности, Putnam 2025 A4","path":"data\\problems\\putnam\\putnam-2025-a4-cycle-commutation-graph-matrices.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/putnam/putnam-2025-a4-cycle-commutation-graph-matrices.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#putnam-2025-a4-cycle-commutation-graph-matrices","source_key":"putnam","source_keys":["putnam"],"source_label":"Putnam","year":"2025","tags":["graph_model","construction","goal_exact_bound","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"putnam-2025-a4-cycle-commutation-graph-matrices цикл как граф коммутирования матриц минимальной размерности, putnam 2025 a4 putnam putnam 2025 graph_model construction goal_exact_bound goal_impossibility putnam-2025-a4-cycle-commutation-graph-matrices tsikl kak graf kommutirovaniya matrits minimalnoy razmernosti, putnam 2025 a4 putnam putnam 2025 graph_model construction goal_exact_bound goal_impossibility"}
{"id":"quadrangulation-euler-face-count","title":"Эйлеров подсчёт четырёхугольного разбиения многоугольника","path":"data\\problems\\classical\\quadrangulation-euler-face-count.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/quadrangulation-euler-face-count.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#quadrangulation-euler-face-count","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["planar_graphs","double_counting","classical_theorem","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"quadrangulation-euler-face-count эйлеров подсчёт четырёхугольного разбиения многоугольника misc прочее planar_graphs double_counting classical_theorem goal_counting quadrangulation-euler-face-count eylerov podschet chetyrehugolnogo razbieniya mnogougolnika misc prochee planar_graphs double_counting classical_theorem goal_counting"}
{"id":"ramsey-r33","title":"Двухцветная раскраска \\(K_6\\) и одноцветный треугольник","path":"data\\problems\\classical\\ramsey-r33.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ramsey-r33.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ramsey-r33","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ramsey-r33 двухцветная раскраска \\(k_6\\) и одноцветный треугольник misc прочее ramsey_theory classical_theorem goal_exact_bound frank p. ramsey ramsey-r33 dvuhtsvetnaya raskraska \\(k_6\\) i odnotsvetnyy treugolnik misc prochee ramsey_theory classical_theorem goal_exact_bound frank p. ramsey"}
{"id":"ramsey-r34","title":"Двухцветная раскраска \\(K_9\\): треугольник или независимая четвёрка","path":"data\\problems\\classical\\ramsey-r34.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ramsey-r34.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ramsey-r34","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ramsey-r34 двухцветная раскраска \\(k_9\\): треугольник или независимая четвёрка misc прочее ramsey_theory classical_theorem goal_exact_bound frank p. ramsey ramsey-r34 dvuhtsvetnaya raskraska \\(k_9\\): treugolnik ili nezavisimaya chetverka misc prochee ramsey_theory classical_theorem goal_exact_bound frank p. ramsey"}
{"id":"ramsey-r35","title":"Двухцветная раскраска \\(K_{14}\\): треугольник или пятёрка","path":"data\\problems\\classical\\ramsey-r35.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ramsey-r35.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ramsey-r35","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ramsey-r35 двухцветная раскраска \\(k_{14}\\): треугольник или пятёрка misc прочее ramsey_theory classical_theorem goal_exact_bound frank p. ramsey robert e. greenwood andrew m. gleason ramsey-r35 dvuhtsvetnaya raskraska \\(k_{14}\\): treugolnik ili pyaterka misc prochee ramsey_theory classical_theorem goal_exact_bound frank p. ramsey robert e. greenwood andrew m. gleason"}
{"id":"ramsey-r44","title":"Двухцветная раскраска \\(K_{18}\\): одноцветная четвёрка","path":"data\\problems\\classical\\ramsey-r44.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ramsey-r44.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ramsey-r44","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ramsey-r44 двухцветная раскраска \\(k_{18}\\): одноцветная четвёрка misc прочее ramsey_theory classical_theorem goal_exact_bound frank p. ramsey robert e. greenwood andrew m. gleason ramsey-r44 dvuhtsvetnaya raskraska \\(k_{18}\\): odnotsvetnaya chetverka misc prochee ramsey_theory classical_theorem goal_exact_bound frank p. ramsey robert e. greenwood andrew m. gleason"}
{"id":"ramsey-theorem","title":"Теорема Рамсея об одноцветной клике","path":"data\\problems\\classical\\ramsey-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ramsey-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ramsey-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","induction","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"ramsey-theorem теорема рамсея об одноцветной клике misc прочее ramsey_theory induction classical_theorem goal_exact_bound frank p. ramsey ramsey-theorem teorema ramseya ob odnotsvetnoy klike misc prochee ramsey_theory induction classical_theorem goal_exact_bound frank p. ramsey"}
{"id":"redei-odd-hamiltonian-paths-tournament","title":"Теорема Редеи о нечётности числа гамильтоновых путей в турнире","path":"data\\problems\\classical\\redei-odd-hamiltonian-paths-tournament.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/redei-odd-hamiltonian-paths-tournament.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#redei-odd-hamiltonian-paths-tournament","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["tournaments","symmetrization","classical_theorem","goal_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"redei-odd-hamiltonian-paths-tournament теорема редеи о нечётности числа гамильтоновых путей в турнире misc прочее tournaments symmetrization classical_theorem goal_counting goal_existence lászló rédei redei-odd-hamiltonian-paths-tournament teorema redei o nechetnosti chisla gamiltonovyh putey v turnire misc prochee tournaments symmetrization classical_theorem goal_counting goal_existence lászló rédei"}
{"id":"regular-bipartite-perfect-matching-decomposition","title":"Разложение регулярного двудольного графа на совершенные паросочетания","path":"data\\problems\\classical\\regular-bipartite-perfect-matching-decomposition.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/regular-bipartite-perfect-matching-decomposition.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#regular-bipartite-perfect-matching-decomposition","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["matching","classical_lemma","induction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"regular-bipartite-perfect-matching-decomposition разложение регулярного двудольного графа на совершенные паросочетания misc прочее matching classical_lemma induction goal_construction dénes kőnig regular-bipartite-perfect-matching-decomposition razlozhenie regulyarnogo dvudolnogo grafa na sovershennye parosochetaniya misc prochee matching classical_lemma induction goal_construction dénes kőnig"}
{"id":"rmm-2012-p1-sociable-sets-bipartite-parity","title":"Чётность покрывающих множеств в двудольном графе знакомств, RMM 2012 P1","path":"data\\problems\\rmm\\rmm-2012-p1-sociable-sets-bipartite-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/rmm/rmm-2012-p1-sociable-sets-bipartite-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#rmm-2012-p1-sociable-sets-bipartite-parity","source_key":"rmm","source_keys":["rmm"],"source_label":"RMM","year":"2012","tags":["double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"rmm-2012-p1-sociable-sets-bipartite-parity чётность покрывающих множеств в двудольном графе знакомств, rmm 2012 p1 rmm rmm 2012 double_counting goal_counting rmm-2012-p1-sociable-sets-bipartite-parity chetnost pokryvayuschih mnozhestv v dvudolnom grafe znakomstv, rmm 2012 p1 rmm rmm 2012 double_counting goal_counting"}
{"id":"rmm-2013-p2-tester-pair-endomorphism-digraph","title":"Тестер-пара через жёсткий раскрашенный орграф, RMM 2013 P2","path":"data\\problems\\rmm\\rmm-2013-p2-tester-pair-endomorphism-digraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/rmm/rmm-2013-p2-tester-pair-endomorphism-digraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#rmm-2013-p2-tester-pair-endomorphism-digraph","source_key":"rmm","source_keys":["rmm"],"source_label":"RMM","year":"2013","tags":["connectivity","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"rmm-2013-p2-tester-pair-endomorphism-digraph тестер-пара через жёсткий раскрашенный орграф, rmm 2013 p2 rmm rmm 2013 connectivity goal_construction rmm-2013-p2-tester-pair-endomorphism-digraph tester-para cherez zhestkiy raskrashennyy orgraf, rmm 2013 p2 rmm rmm 2013 connectivity goal_construction"}
{"id":"rmm-2016-p6-ab-tree-termination-semiinvariant","title":"Конечность преобразований AB-деревьев, RMM 2016 P6","path":"data\\problems\\rmm\\rmm-2016-p6-ab-tree-termination-semiinvariant.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/rmm/rmm-2016-p6-ab-tree-termination-semiinvariant.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#rmm-2016-p6-ab-tree-termination-semiinvariant","source_key":"rmm","source_keys":["rmm"],"source_label":"RMM","year":"2016","tags":["trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"rmm-2016-p6-ab-tree-termination-semiinvariant конечность преобразований ab-деревьев, rmm 2016 p6 rmm rmm 2016 trees goal_proof rmm-2016-p6-ab-tree-termination-semiinvariant konechnost preobrazovaniy ab-derevev, rmm 2016 p6 rmm rmm 2016 trees goal_proof"}
{"id":"rmm-2017-p5-sieve-sticks-bipartite-matching","title":"Разбиение решета на минимальное число палочек, RMM 2017 P5","path":"data\\problems\\rmm\\rmm-2017-p5-sieve-sticks-bipartite-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/rmm/rmm-2017-p5-sieve-sticks-bipartite-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#rmm-2017-p5-sieve-sticks-bipartite-matching","source_key":"rmm","source_keys":["rmm"],"source_label":"RMM","year":"2017","tags":["matching","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"rmm-2017-p5-sieve-sticks-bipartite-matching разбиение решета на минимальное число палочек, rmm 2017 p5 rmm rmm 2017 matching goal_classification palmer mebane nikolai beluhov rmm-2017-p5-sieve-sticks-bipartite-matching razbienie resheta na minimalnoe chislo palochek, rmm 2017 p5 rmm rmm 2017 matching goal_classification palmer mebane nikolai beluhov"}
{"id":"rmm-2023-p6-colored-spanning-tree-suspicious-edges","title":"Счёт цветов в остовах через подозрительные рёбра, RMM 2023 P6","path":"data\\problems\\rmm\\rmm-2023-p6-colored-spanning-tree-suspicious-edges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/rmm/rmm-2023-p6-colored-spanning-tree-suspicious-edges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#rmm-2023-p6-colored-spanning-tree-suspicious-edges","source_key":"rmm","source_keys":["rmm"],"source_label":"RMM","year":"2023","tags":["trees","coloring","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"rmm-2023-p6-colored-spanning-tree-suspicious-edges счёт цветов в остовах через подозрительные рёбра, rmm 2023 p6 rmm rmm 2023 trees coloring goal_existence rmm-2023-p6-colored-spanning-tree-suspicious-edges schet tsvetov v ostovah cherez podozritelnye rebra, rmm 2023 p6 rmm rmm 2023 trees coloring goal_existence"}
{"id":"robbins-strong-orientation-theorem","title":"Теорема Роббинса о сильной ориентации графа без мостов","path":"data\\problems\\classical\\robbins-strong-orientation-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/robbins-strong-orientation-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#robbins-strong-orientation-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["connectivity","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"robbins-strong-orientation-theorem теорема роббинса о сильной ориентации графа без мостов misc прочее connectivity classical_theorem goal_characterization herbert robbins robbins-strong-orientation-theorem teorema robbinsa o silnoy orientatsii grafa bez mostov misc prochee connectivity classical_theorem goal_characterization herbert robbins"}
{"id":"round-robin-winner-count-hall-lemma","title":"Число разных победителей в произвольном наборе дней кругового турнира","path":"data\\problems\\classical\\round-robin-winner-count-hall-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/round-robin-winner-count-hall-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#round-robin-winner-count-hall-lemma","source_key":"misc","source_keys":["misc","putnam"],"source_label":"Прочее","year":"","tags":["matching","tournaments","double_counting","goal_existence","classical_lemma"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"round-robin-winner-count-hall-lemma число разных победителей в произвольном наборе дней кругового турнира misc прочее matching tournaments double_counting goal_existence classical_lemma round-robin-winner-count-hall-lemma chislo raznyh pobediteley v proizvolnom nabore dney krugovogo turnira misc prochee matching tournaments double_counting goal_existence classical_lemma"}
{"id":"school239-2021-10-11-p8-friendship-parity-postcards","title":"Граф друзей с чётностью общих соседей и открытками, Открытая олимпиада ФМЛ 239 2021","path":"data\\problems\\school239\\school239-2021-10-11-p8-friendship-parity-postcards.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/school239/school239-2021-10-11-p8-friendship-parity-postcards.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#school239-2021-10-11-p8-friendship-parity-postcards","source_key":"school239","source_keys":["school239"],"source_label":"Открытая олимпиада ФМЛ 239","year":"2021","tags":["graph_model","degree_counting","invariant","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"school239-2021-10-11-p8-friendship-parity-postcards граф друзей с чётностью общих соседей и открытками, открытая олимпиада фмл 239 2021 school239 открытая олимпиада фмл 239 2021 graph_model degree_counting invariant goal_counting school239-2021-10-11-p8-friendship-parity-postcards graf druzey s chetnostyu obschih sosedey i otkrytkami, otkrytaya olimpiada fml 239 2021 school239 otkrytaya olimpiada fml 239 2021 graph_model degree_counting invariant goal_counting"}
{"id":"school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle","title":"Короткий нечётный цикл в недвудольном графе на 239 вершинах, Открытая олимпиада ФМЛ 239 2021","path":"data\\problems\\school239\\school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/school239/school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle","source_key":"school239","source_keys":["school239"],"source_label":"Открытая олимпиада ФМЛ 239","year":"2021","tags":["extremal_graph_theory","connectivity","degree_counting","goal_exact_bound","construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle короткий нечётный цикл в недвудольном графе на 239 вершинах, открытая олимпиада фмл 239 2021 school239 открытая олимпиада фмл 239 2021 extremal_graph_theory connectivity degree_counting goal_exact_bound construction school239-2021-8-9-p3-nonbipartite-min-degree-odd-cycle korotkiy nechetnyy tsikl v nedvudolnom grafe na 239 vershinah, otkrytaya olimpiada fml 239 2021 school239 otkrytaya olimpiada fml 239 2021 extremal_graph_theory connectivity degree_counting goal_exact_bound construction"}
{"id":"school239-2024-10-11-p8-empty-disk-perfect-matching","title":"Разбиение точек на пары, покрываемые пустыми кругами, Открытая олимпиада ФМЛ 239 2024","path":"data\\problems\\school239\\school239-2024-10-11-p8-empty-disk-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/school239/school239-2024-10-11-p8-empty-disk-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#school239-2024-10-11-p8-empty-disk-perfect-matching","source_key":"school239","source_keys":["school239"],"source_label":"Открытая олимпиада ФМЛ 239","year":"2024","tags":["matching","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"school239-2024-10-11-p8-empty-disk-perfect-matching разбиение точек на пары, покрываемые пустыми кругами, открытая олимпиада фмл 239 2024 school239 открытая олимпиада фмл 239 2024 matching graph_model goal_existence school239-2024-10-11-p8-empty-disk-perfect-matching razbienie tochek na pary, pokryvaemye pustymi krugami, otkrytaya olimpiada fml 239 2024 school239 otkrytaya olimpiada fml 239 2024 matching graph_model goal_existence"}
{"id":"school239-2024-8-9-p2-noncrossing-segments-perfect-matching","title":"Паросочетание среди непересекающихся отрезков, Открытая олимпиада ФМЛ 239 2024","path":"data\\problems\\school239\\school239-2024-8-9-p2-noncrossing-segments-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/school239/school239-2024-8-9-p2-noncrossing-segments-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#school239-2024-8-9-p2-noncrossing-segments-perfect-matching","source_key":"school239","source_keys":["school239"],"source_label":"Открытая олимпиада ФМЛ 239","year":"2024","tags":["matching","planar_graphs","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"school239-2024-8-9-p2-noncrossing-segments-perfect-matching паросочетание среди непересекающихся отрезков, открытая олимпиада фмл 239 2024 school239 открытая олимпиада фмл 239 2024 matching planar_graphs graph_model goal_existence school239-2024-8-9-p2-noncrossing-segments-perfect-matching parosochetanie sredi neperesekayuschihsya otrezkov, otkrytaya olimpiada fml 239 2024 school239 otkrytaya olimpiada fml 239 2024 matching planar_graphs graph_model goal_existence"}
{"id":"shortest-odd-cycle-external-neighbor-bound","title":"Внешняя вершина кратчайшего нечётного цикла","path":"data\\problems\\classical\\shortest-odd-cycle-external-neighbor-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/shortest-odd-cycle-external-neighbor-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#shortest-odd-cycle-external-neighbor-bound","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","forbidden_clique","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"shortest-odd-cycle-external-neighbor-bound внешняя вершина кратчайшего нечётного цикла misc прочее coloring forbidden_clique goal_exact_bound дольников в.л. shortest-odd-cycle-external-neighbor-bound vneshnyaya vershina kratchayshego nechetnogo tsikla misc prochee coloring forbidden_clique goal_exact_bound dolnikov v.l."}
{"id":"sim-k6-no-draw","title":"Игра SIM на \\(K_6\\): ничья невозможна","path":"data\\problems\\classical\\sim-k6-no-draw.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/sim-k6-no-draw.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sim-k6-no-draw","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["ramsey_theory","coloring","forbidden_triangle","pigeonhole_principle","goal_impossibility","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"sim-k6-no-draw игра sim на \\(k_6\\): ничья невозможна misc прочее ramsey_theory coloring forbidden_triangle pigeonhole_principle goal_impossibility goal_strategy_game gustavus j. simmons sim-k6-no-draw igra sim na \\(k_6\\): nichya nevozmozhna misc prochee ramsey_theory coloring forbidden_triangle pigeonhole_principle goal_impossibility goal_strategy_game gustavus j. simmons"}
{"id":"simon-marais-2017-a1-pentagon-triangle-game","title":"Игра до первого одноцветного треугольника на полном графе","path":"data\\problems\\simon-marais\\simon-marais-2017-a1-pentagon-triangle-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2017-a1-pentagon-triangle-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2017-a1-pentagon-triangle-game","source_key":"simon","source_keys":["simon","lktg"],"source_label":"SIMON","year":"2017","tags":["coloring","graph_symmetry","goal_strategy_game","ramsey_theory"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2017-a1-pentagon-triangle-game игра до первого одноцветного треугольника на полном графе simon simon 2017 coloring graph_symmetry goal_strategy_game ramsey_theory simon-marais-2017-a1-pentagon-triangle-game igra do pervogo odnotsvetnogo treugolnika na polnom grafe simon simon 2017 coloring graph_symmetry goal_strategy_game ramsey_theory"}
{"id":"simon-marais-2017-b3-red-lattice-connected-graph","title":"Красные треугольники в раскраске целочисленной решётки, Simon Marais 2017 B3","path":"data\\problems\\simon-marais\\simon-marais-2017-b3-red-lattice-connected-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2017-b3-red-lattice-connected-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2017-b3-red-lattice-connected-graph","source_key":"simon","source_keys":["simon"],"source_label":"Simon Marais","year":"2017","tags":["connectivity","graph_in_solution","minimal_counterexample","extremal_choice","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2017-b3-red-lattice-connected-graph красные треугольники в раскраске целочисленной решётки, simon marais 2017 b3 simon simon marais 2017 connectivity graph_in_solution minimal_counterexample extremal_choice trees goal_proof simon-marais-2017-b3-red-lattice-connected-graph krasnye treugolniki v raskraske tselochislennoy reshetki, simon marais 2017 b3 simon simon marais 2017 connectivity graph_in_solution minimal_counterexample extremal_choice trees goal_proof"}
{"id":"simon-marais-2018-b3-dodecahedron-spider-pursuit","title":"Погоня трёх пауков за жуком на графе додекаэдра, SMMC 2018 B3","path":"data\\problems\\simon-marais\\simon-marais-2018-b3-dodecahedron-spider-pursuit.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2018-b3-dodecahedron-spider-pursuit.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2018-b3-dodecahedron-spider-pursuit","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2018","tags":["graph_model","goal_strategy_game","graph_symmetry","trees","connectivity"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2018-b3-dodecahedron-spider-pursuit погоня трёх пауков за жуком на графе додекаэдра, smmc 2018 b3 simon smmc 2018 graph_model goal_strategy_game graph_symmetry trees connectivity simon-marais-2018-b3-dodecahedron-spider-pursuit pogonya treh paukov za zhukom na grafe dodekaedra, smmc 2018 b3 simon smmc 2018 graph_model goal_strategy_game graph_symmetry trees connectivity"}
{"id":"simon-marais-2019-b3-motzkin-straus-clique-labeling","title":"Максимум суммы произведений меток на рёбрах и кликовое число, SMMC 2019 B3","path":"data\\problems\\simon-marais\\simon-marais-2019-b3-motzkin-straus-clique-labeling.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2019-b3-motzkin-straus-clique-labeling.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2019-b3-motzkin-straus-clique-labeling","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2019","tags":["extremal_graph_theory","extremal_choice","forbidden_clique","goal_exact_bound","symmetrization","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2019-b3-motzkin-straus-clique-labeling максимум суммы произведений меток на рёбрах и кликовое число, smmc 2019 b3 simon smmc 2019 extremal_graph_theory extremal_choice forbidden_clique goal_exact_bound symmetrization classical_theorem simon-marais-2019-b3-motzkin-straus-clique-labeling maksimum summy proizvedeniy metok na rebrah i klikovoe chislo, smmc 2019 b3 simon smmc 2019 extremal_graph_theory extremal_choice forbidden_clique goal_exact_bound symmetrization classical_theorem"}
{"id":"simon-marais-2020-a1-odd-cycle-line-transversal","title":"Нечетная 2-регулярная конфигурация и прямая-трансверсаль, Simon Marais 2020 A1","path":"data\\problems\\simon-marais\\simon-marais-2020-a1-odd-cycle-line-transversal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2020-a1-odd-cycle-line-transversal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2020-a1-odd-cycle-line-transversal","source_key":"simon","source_keys":["simon"],"source_label":"Simon Marais","year":"2020","tags":["graph_model","coloring","parity_coloring","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2020-a1-odd-cycle-line-transversal нечетная 2-регулярная конфигурация и прямая-трансверсаль, simon marais 2020 a1 simon simon marais 2020 graph_model coloring parity_coloring goal_impossibility simon-marais-2020-a1-odd-cycle-line-transversal nechetnaya 2-regulyarnaya konfiguratsiya i pryamaya-transversal, simon marais 2020 a1 simon simon marais 2020 graph_model coloring parity_coloring goal_impossibility"}
{"id":"simon-marais-2020-b4-rainbow-distance-clique-polygon","title":"Радужная клика по расстояниям в правильном многоугольнике, Simon Marais 2020 B4","path":"data\\problems\\simon-marais\\simon-marais-2020-b4-rainbow-distance-clique-polygon.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2020-b4-rainbow-distance-clique-polygon.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2020-b4-rainbow-distance-clique-polygon","source_key":"simon","source_keys":["simon"],"source_label":"Simon Marais","year":"2020","tags":["graph_model","coloring","construction","goal_construction","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2020-b4-rainbow-distance-clique-polygon радужная клика по расстояниям в правильном многоугольнике, simon marais 2020 b4 simon simon marais 2020 graph_model coloring construction goal_construction goal_classification simon-marais-2020-b4-rainbow-distance-clique-polygon raduzhnaya klika po rasstoyaniyam v pravilnom mnogougolnike, simon marais 2020 b4 simon simon marais 2020 graph_model coloring construction goal_construction goal_classification"}
{"id":"simon-marais-2021-a3-determinants-cycle-components","title":"Детерминанты 0-1 матриц с короткими строками, Simon Marais 2021 A3","path":"data\\problems\\simon-marais\\simon-marais-2021-a3-determinants-cycle-components.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2021-a3-determinants-cycle-components.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2021-a3-determinants-cycle-components","source_key":"simon","source_keys":["simon"],"source_label":"Simon Marais","year":"2021","tags":["graph_in_solution","degree_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2021-a3-determinants-cycle-components детерминанты 0-1 матриц с короткими строками, simon marais 2021 a3 simon simon marais 2021 graph_in_solution degree_counting goal_counting simon-marais-2021-a3-determinants-cycle-components determinanty 0-1 matrits s korotkimi strokami, simon marais 2021 a3 simon simon marais 2021 graph_in_solution degree_counting goal_counting"}
{"id":"simon-marais-2022-c3-random-walk-cycle-five","title":"Случайное блуждание по циклу из пяти вершин, Simon Marais 2022 C3","path":"data\\problems\\simon-marais\\simon-marais-2022-c3-random-walk-cycle-five.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2022-c3-random-walk-cycle-five.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2022-c3-random-walk-cycle-five","source_key":"simon","source_keys":["simon"],"source_label":"Simon Marais","year":"2022","tags":["graph_model","graph_symmetry","induction","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2022-c3-random-walk-cycle-five случайное блуждание по циклу из пяти вершин, simon marais 2022 c3 simon simon marais 2022 graph_model graph_symmetry induction goal_bound simon-marais-2022-c3-random-walk-cycle-five sluchaynoe bluzhdanie po tsiklu iz pyati vershin, simon marais 2022 c3 simon simon marais 2022 graph_model graph_symmetry induction goal_bound"}
{"id":"simon-marais-2023-c2-line-arrangement-region-coloring","title":"Раскраска областей в расположении отрезков, SMMC 2023 C2","path":"data\\problems\\simon-marais\\simon-marais-2023-c2-line-arrangement-region-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2023-c2-line-arrangement-region-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2023-c2-line-arrangement-region-coloring","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2023","tags":["planar_graphs","coloring","parity_coloring","region_adjacency","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2023-c2-line-arrangement-region-coloring раскраска областей в расположении отрезков, smmc 2023 c2 simon smmc 2023 planar_graphs coloring parity_coloring region_adjacency goal_characterization simon-marais-2023-c2-line-arrangement-region-coloring raskraska oblastey v raspolozhenii otrezkov, smmc 2023 c2 simon smmc 2023 planar_graphs coloring parity_coloring region_adjacency goal_characterization"}
{"id":"simon-marais-2023-c4-reverse-chess-grid-pursuit","title":"Обратные шахматы: порог для погони королей за ладьёй на решётке, SMMC 2023 C4","path":"data\\problems\\simon-marais\\simon-marais-2023-c4-reverse-chess-grid-pursuit.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2023-c4-reverse-chess-grid-pursuit.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2023-c4-reverse-chess-grid-pursuit","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2023","tags":["graph_model","goal_strategy_game","construction","invariant","pigeonhole_principle"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2023-c4-reverse-chess-grid-pursuit обратные шахматы: порог для погони королей за ладьёй на решётке, smmc 2023 c4 simon smmc 2023 graph_model goal_strategy_game construction invariant pigeonhole_principle simon-marais-2023-c4-reverse-chess-grid-pursuit obratnye shahmaty: porog dlya pogoni koroley za ladey na reshetke, smmc 2023 c4 simon smmc 2023 graph_model goal_strategy_game construction invariant pigeonhole_principle"}
{"id":"simon-marais-2024-a2-tripairable-perfect-matching","title":"Паросочетания по суммам-степеням тройки, SMMC 2024 A2","path":"data\\problems\\simon-marais\\simon-marais-2024-a2-tripairable-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2024-a2-tripairable-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2024-a2-tripairable-perfect-matching","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2024","tags":["matching","induction","invariant","goal_counting","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2024-a2-tripairable-perfect-matching паросочетания по суммам-степеням тройки, smmc 2024 a2 simon smmc 2024 matching induction invariant goal_counting graph_model michael albert christopher tuffley simon-marais-2024-a2-tripairable-perfect-matching parosochetaniya po summam-stepenyam troyki, smmc 2024 a2 simon smmc 2024 matching induction invariant goal_counting graph_model michael albert christopher tuffley"}
{"id":"simon-marais-2024-c4-random-maximal-independent-set-path","title":"Случайное максимальное независимое множество в пути, SMMC 2024 C4","path":"data\\problems\\simon-marais\\simon-marais-2024-c4-random-maximal-independent-set-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2024-c4-random-maximal-independent-set-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2024-c4-random-maximal-independent-set-path","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2024","tags":["graph_model","trees","dynamics","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2024-c4-random-maximal-independent-set-path случайное максимальное независимое множество в пути, smmc 2024 c4 simon smmc 2024 graph_model trees dynamics goal_exact_bound tony guttman simon-marais-2024-c4-random-maximal-independent-set-path sluchaynoe maksimalnoe nezavisimoe mnozhestvo v puti, smmc 2024 c4 simon smmc 2024 graph_model trees dynamics goal_exact_bound tony guttman"}
{"id":"simon-marais-2025-b1-beaut-functions-gcd-graph","title":"Beaut-функции и раскраска графа общих делителей, SMMC 2025 B1","path":"data\\problems\\simon-marais\\simon-marais-2025-b1-beaut-functions-gcd-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/simon-marais/simon-marais-2025-b1-beaut-functions-gcd-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#simon-marais-2025-b1-beaut-functions-gcd-graph","source_key":"simon","source_keys":["simon"],"source_label":"SMMC","year":"2025","tags":["graph_model","coloring","extremal_choice","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"simon-marais-2025-b1-beaut-functions-gcd-graph beaut-функции и раскраска графа общих делителей, smmc 2025 b1 simon smmc 2025 graph_model coloring extremal_choice goal_characterization liam baker simon-marais-2025-b1-beaut-functions-gcd-graph beaut-funktsii i raskraska grafa obschih deliteley, smmc 2025 b1 simon smmc 2025 graph_model coloring extremal_choice goal_characterization liam baker"}
{"id":"spbmo-1992-11-p55-two-connected-halves","title":"Разбиение дважды связного графа на две связные половины, СПбМО 1992","path":"data\\problems\\spbmo\\spbmo-1992-11-p55-two-connected-halves.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1992-11-p55-two-connected-halves.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1992-11-p55-two-connected-halves","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1992","tags":["connectivity","construction","goal_existence","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1992-11-p55-two-connected-halves разбиение дважды связного графа на две связные половины, спбмо 1992 spbmo спбмо 1992 connectivity construction goal_existence graph_model spbmo-1992-11-p55-two-connected-halves razbienie dvazhdy svyaznogo grafa na dve svyaznye poloviny, spbmo 1992 spbmo spbmo 1992 connectivity construction goal_existence graph_model"}
{"id":"spbmo-1993-7-p12-unsociable-eccentrics","title":"Малообщительные и чудаки в графе знакомств, СПбМО 1993","path":"data\\problems\\spbmo\\spbmo-1993-7-p12-unsociable-eccentrics.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1993-7-p12-unsociable-eccentrics.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1993-7-p12-unsociable-eccentrics","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1993","tags":["degree_counting","cut_counting","double_counting","graph_model","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1993-7-p12-unsociable-eccentrics малообщительные и чудаки в графе знакомств, спбмо 1993 spbmo спбмо 1993 degree_counting cut_counting double_counting graph_model goal_proof spbmo-1993-7-p12-unsociable-eccentrics maloobschitelnye i chudaki v grafe znakomstv, spbmo 1993 spbmo spbmo 1993 degree_counting cut_counting double_counting graph_model goal_proof"}
{"id":"spbmo-1996-11-p63-metro-distant-stations","title":"Максимум попарно далеких станций метро при 120 линиях, СПбМО 1996","path":"data\\problems\\spbmo\\spbmo-1996-11-p63-metro-distant-stations.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1996-11-p63-metro-distant-stations.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1996-11-p63-metro-distant-stations","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1996","tags":["connectivity","construction","extremal_choice","goal_exact_bound","graph_model","pigeonhole_principle"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1996-11-p63-metro-distant-stations максимум попарно далеких станций метро при 120 линиях, спбмо 1996 spbmo спбмо 1996 connectivity construction extremal_choice goal_exact_bound graph_model pigeonhole_principle spbmo-1996-11-p63-metro-distant-stations maksimum poparno dalekih stantsiy metro pri 120 liniyah, spbmo 1996 spbmo spbmo 1996 connectivity construction extremal_choice goal_exact_bound graph_model pigeonhole_principle"}
{"id":"spbmo-1996-9-p46-strongly-connected-tournament-orientations","title":"Больше половины ориентаций полного графа сильно связны, СПбМО 1996","path":"data\\problems\\spbmo\\spbmo-1996-9-p46-strongly-connected-tournament-orientations.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1996-9-p46-strongly-connected-tournament-orientations.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1996-9-p46-strongly-connected-tournament-orientations","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1996","tags":["tournaments","connectivity","cut_counting","goal_counting","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1996-9-p46-strongly-connected-tournament-orientations больше половины ориентаций полного графа сильно связны, спбмо 1996 spbmo спбмо 1996 tournaments connectivity cut_counting goal_counting graph_model spbmo-1996-9-p46-strongly-connected-tournament-orientations bolshe poloviny orientatsiy polnogo grafa silno svyazny, spbmo 1996 spbmo spbmo 1996 tournaments connectivity cut_counting goal_counting graph_model"}
{"id":"spbmo-1997-10-p34-million-common-acquaintance-dominating-set","title":"5000 жителей, знакомых со всеми остальными через общий выбор, СПбМО 1997","path":"data\\problems\\spbmo\\spbmo-1997-10-p34-million-common-acquaintance-dominating-set.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1997-10-p34-million-common-acquaintance-dominating-set.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1997-10-p34-million-common-acquaintance-dominating-set","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1997","tags":["graph_model","connectivity","degree_counting","extremal_choice","goal_existence","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1997-10-p34-million-common-acquaintance-dominating-set 5000 жителей, знакомых со всеми остальными через общий выбор, спбмо 1997 spbmo спбмо 1997 graph_model connectivity degree_counting extremal_choice goal_existence goal_bound spbmo-1997-10-p34-million-common-acquaintance-dominating-set 5000 zhiteley, znakomyh so vsemi ostalnymi cherez obschiy vybor, spbmo 1997 spbmo spbmo 1997 graph_model connectivity degree_counting extremal_choice goal_existence goal_bound"}
{"id":"spbmo-1997-11-p54-triangular-polyhedron-degrees","title":"Треугольная грань со степенями 5, 6 и 6 в триангулированном многограннике, СПбМО 1997","path":"data\\problems\\spbmo\\spbmo-1997-11-p54-triangular-polyhedron-degrees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1997-11-p54-triangular-polyhedron-degrees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1997-11-p54-triangular-polyhedron-degrees","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1997","tags":["planar_graphs","degree_counting","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1997-11-p54-triangular-polyhedron-degrees треугольная грань со степенями 5, 6 и 6 в триангулированном многограннике, спбмо 1997 spbmo спбмо 1997 planar_graphs degree_counting double_counting goal_existence spbmo-1997-11-p54-triangular-polyhedron-degrees treugolnaya gran so stepenyami 5, 6 i 6 v triangulirovannom mnogogrannike, spbmo 1997 spbmo spbmo 1997 planar_graphs degree_counting double_counting goal_existence"}
{"id":"spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count","title":"Равенство чисел способов удалить две одноцветные непересекающиеся связи, СПбМО 1997","path":"data\\problems\\spbmo\\spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1997","tags":["coloring","double_counting","degree_counting","goal_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count равенство чисел способов удалить две одноцветные непересекающиеся связи, спбмо 1997 spbmo спбмо 1997 coloring double_counting degree_counting goal_counting goal_proof spbmo-1997-11-p63-red-blue-complete-graph-two-edge-count ravenstvo chisel sposobov udalit dve odnotsvetnye neperesekayuschiesya svyazi, spbmo 1997 spbmo spbmo 1997 coloring double_counting degree_counting goal_counting goal_proof"}
{"id":"spbmo-1997-7-p13-left-right-city-walk","title":"Маршрут по городу с поворотами налево и направо, СПбМО 1997","path":"data\\problems\\spbmo\\spbmo-1997-7-p13-left-right-city-walk.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1997-7-p13-left-right-city-walk.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1997-7-p13-left-right-city-walk","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1997","tags":["planar_graphs","coloring","invariant","graph_model","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1997-7-p13-left-right-city-walk маршрут по городу с поворотами налево и направо, спбмо 1997 spbmo спбмо 1997 planar_graphs coloring invariant graph_model goal_proof spbmo-1997-7-p13-left-right-city-walk marshrut po gorodu s povorotami nalevo i napravo, spbmo 1997 spbmo spbmo 1997 planar_graphs coloring invariant graph_model goal_proof"}
{"id":"spbmo-1997-9-p27-common-acquaintance-dominating-set","title":"Выбор трети жителей при общем знакомом, СПбМО 1997","path":"data\\problems\\spbmo\\spbmo-1997-9-p27-common-acquaintance-dominating-set.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-1997-9-p27-common-acquaintance-dominating-set.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-1997-9-p27-common-acquaintance-dominating-set","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"1997","tags":["graph_model","degree_counting","extremal_choice","goal_existence","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-1997-9-p27-common-acquaintance-dominating-set выбор трети жителей при общем знакомом, спбмо 1997 spbmo спбмо 1997 graph_model degree_counting extremal_choice goal_existence goal_bound spbmo-1997-9-p27-common-acquaintance-dominating-set vybor treti zhiteley pri obschem znakomom, spbmo 1997 spbmo spbmo 1997 graph_model degree_counting extremal_choice goal_existence goal_bound"}
{"id":"spbmo-2003-11-qual-p6-kernel-graph-shortened","title":"Захолустные соседи в дереве малого диаметра, СПбМО 2003, отборочный тур, 11 класс P6","path":"data\\problems\\spbmo\\spbmo-2003-11-qual-p6-kernel-graph-shortened.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2003-11-qual-p6-kernel-graph-shortened.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2003-11-qual-p6-kernel-graph-shortened","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2003","tags":["degree_counting","trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2003-11-qual-p6-kernel-graph-shortened захолустные соседи в дереве малого диаметра, спбмо 2003, отборочный тур, 11 класс p6 spbmo спбмо 2003 degree_counting trees goal_proof пастор а. spbmo-2003-11-qual-p6-kernel-graph-shortened zaholustnye sosedi v dereve malogo diametra, spbmo 2003, otborochnyy tur, 11 klass p6 spbmo spbmo 2003 degree_counting trees goal_proof pastor a."}
{"id":"spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring","title":"Раскраска вершин графа по условию на цвета ребер, СПбМО 2003, 9 класс, отборочный тур, задача 5","path":"data\\problems\\spbmo\\spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2003","tags":["coloring","graph_model","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring раскраска вершин графа по условию на цвета ребер, спбмо 2003, 9 класс, отборочный тур, задача 5 spbmo спбмо 2003 coloring graph_model goal_proof берлов с.л. карпов д.в. пастор а. spbmo-2003-9-qual-p5-edge-colored-graph-vertex-coloring raskraska vershin grafa po usloviyu na tsveta reber, spbmo 2003, 9 klass, otborochnyy tur, zadacha 5 spbmo spbmo 2003 coloring graph_model goal_proof berlov s.l. karpov d.v. pastor a."}
{"id":"spbmo-2009-11-6-monochromatic-long-cycle","title":"Длинный одноцветный цикл при минимальной степени 2008, СПбМО 2009, 11 класс, II тур, задача 6","path":"data\\problems\\spbmo\\spbmo-2009-11-6-monochromatic-long-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2009-11-6-monochromatic-long-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2009-11-6-monochromatic-long-cycle","source_key":"spbmo","source_keys":["spbmo"],"source_label":"Длинный одноцветный цикл при минимальной степени","year":"2009","tags":["extremal_graph_theory","coloring","double_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2009-11-6-monochromatic-long-cycle длинный одноцветный цикл при минимальной степени 2008, спбмо 2009, 11 класс, ii тур, задача 6 spbmo длинный одноцветный цикл при минимальной степени 2009 extremal_graph_theory coloring double_counting goal_existence spbmo-2009-11-6-monochromatic-long-cycle dlinnyy odnotsvetnyy tsikl pri minimalnoy stepeni 2008, spbmo 2009, 11 klass, ii tur, zadacha 6 spbmo dlinnyy odnotsvetnyy tsikl pri minimalnoy stepeni 2009 extremal_graph_theory coloring double_counting goal_existence"}
{"id":"spbmo-2010-10-p4-cubic-edge-company-game","title":"Игра на рёбрах кубического графа и три компании, СПбМО 2010, 10 класс, задача 4","path":"data\\problems\\spbmo\\spbmo-2010-10-p4-cubic-edge-company-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2010-10-p4-cubic-edge-company-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2010-10-p4-cubic-edge-company-game","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2010","tags":["coloring","goal_strategy_game","graph_model","invariant","minimal_counterexample"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2010-10-p4-cubic-edge-company-game игра на рёбрах кубического графа и три компании, спбмо 2010, 10 класс, задача 4 spbmo спбмо 2010 coloring goal_strategy_game graph_model invariant minimal_counterexample карпов д.в. spbmo-2010-10-p4-cubic-edge-company-game igra na rebrah kubicheskogo grafa i tri kompanii, spbmo 2010, 10 klass, zadacha 4 spbmo spbmo 2010 coloring goal_strategy_game graph_model invariant minimal_counterexample karpov d.v."}
{"id":"spbmo-2010-11-p3-k2009-long-cycle-game","title":"Игра на полном графе \\(K_{2009}\\) и цикл длины 75, СПбМО 2010, 11 класс, II тур, задача 3","path":"data\\problems\\spbmo\\spbmo-2010-11-p3-k2009-long-cycle-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2010-11-p3-k2009-long-cycle-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2010-11-p3-k2009-long-cycle-game","source_key":"spbmo","source_keys":["spbmo"],"source_label":"Игра на полном графе \\(K_{","year":"2010","tags":["goal_strategy_game","construction","pigeonhole_principle","graph_model"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2010-11-p3-k2009-long-cycle-game игра на полном графе \\(k_{2009}\\) и цикл длины 75, спбмо 2010, 11 класс, ii тур, задача 3 spbmo игра на полном графе \\(k_{ 2010 goal_strategy_game construction pigeonhole_principle graph_model берлов с.л. spbmo-2010-11-p3-k2009-long-cycle-game igra na polnom grafe \\(k_{2009}\\) i tsikl dliny 75, spbmo 2010, 11 klass, ii tur, zadacha 3 spbmo igra na polnom grafe \\(k_{ 2010 goal_strategy_game construction pigeonhole_principle graph_model berlov s.l."}
{"id":"spbmo-2010-9-p5-k2010-cycle-game","title":"Игра на полном графе \\(K_{2010}\\) и цикл длины 11, СПбМО 2010, 9 класс, II тур, задача 5","path":"data\\problems\\spbmo\\spbmo-2010-9-p5-k2010-cycle-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2010-9-p5-k2010-cycle-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2010-9-p5-k2010-cycle-game","source_key":"spbmo","source_keys":["spbmo"],"source_label":"Игра на полном графе \\(K_{","year":"2010","tags":["goal_strategy_game","construction","pigeonhole_principle","trees","graph_model"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2010-9-p5-k2010-cycle-game игра на полном графе \\(k_{2010}\\) и цикл длины 11, спбмо 2010, 9 класс, ii тур, задача 5 spbmo игра на полном графе \\(k_{ 2010 goal_strategy_game construction pigeonhole_principle trees graph_model берлов с.л. spbmo-2010-9-p5-k2010-cycle-game igra na polnom grafe \\(k_{2010}\\) i tsikl dliny 11, spbmo 2010, 9 klass, ii tur, zadacha 5 spbmo igra na polnom grafe \\(k_{ 2010 goal_strategy_game construction pigeonhole_principle trees graph_model berlov s.l."}
{"id":"spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4","title":"Треугольник в каждой выборке из 2000 жителей и четверо попарно знакомых, СПбМО 2011","path":"data\\problems\\spbmo\\spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4","source_key":"spbmo","source_keys":["spbmo"],"source_label":"Треугольник в каждой выборке из","year":"2000","tags":["graph_model","ramsey_theory","coloring","forbidden_clique","forbidden_triangle","degree_counting","double_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4 треугольник в каждой выборке из 2000 жителей и четверо попарно знакомых, спбмо 2011 spbmo треугольник в каждой выборке из 2000 graph_model ramsey_theory coloring forbidden_clique forbidden_triangle degree_counting double_counting goal_proof а. голованов берлов с.л. spbmo-2011-9-10-p4-triangle-in-every-2000-set-k4 treugolnik v kazhdoy vyborke iz 2000 zhiteley i chetvero poparno znakomyh, spbmo 2011 spbmo treugolnik v kazhdoy vyborke iz 2000 graph_model ramsey_theory coloring forbidden_clique forbidden_triangle degree_counting double_counting goal_proof a. golovanov berlov s.l."}
{"id":"spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3","title":"Двудольный граф авиалиний и число ациклических ориентаций по модулю 3, СПбМО 2012","path":"data\\problems\\spbmo\\spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2012","tags":["graph_model","coloring","induction","goal_counting","invariant"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3 двудольный граф авиалиний и число ациклических ориентаций по модулю 3, спбмо 2012 spbmo спбмо 2012 graph_model coloring induction goal_counting invariant fedor petrov spbmo-2012-11-p7-bipartite-acyclic-orientations-mod3 dvudolnyy graf avialiniy i chislo atsiklicheskih orientatsiy po modulyu 3, spbmo 2012 spbmo spbmo 2012 graph_model coloring induction goal_counting invariant fedor petrov"}
{"id":"spbmo-2012-7-p4-forty-regular-acquaintance-four-people","title":"40-регулярный граф знакомств и четыре человека с двумя знакомствами и двумя незнакомствами, СПбМО 2012","path":"data\\problems\\spbmo\\spbmo-2012-7-p4-forty-regular-acquaintance-four-people.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2012-7-p4-forty-regular-acquaintance-four-people.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2012-7-p4-forty-regular-acquaintance-four-people","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2012","tags":["degree_counting","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2012-7-p4-forty-regular-acquaintance-four-people 40-регулярный граф знакомств и четыре человека с двумя знакомствами и двумя незнакомствами, спбмо 2012 spbmo спбмо 2012 degree_counting graph_model goal_existence берлов с.л. spbmo-2012-7-p4-forty-regular-acquaintance-four-people 40-regulyarnyy graf znakomstv i chetyre cheloveka s dvumya znakomstvami i dvumya neznakomstvami, spbmo 2012 spbmo spbmo 2012 degree_counting graph_model goal_existence berlov s.l."}
{"id":"spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle","title":"Чередующаяся рассадка 22 человек в 40-регулярном графе знакомств, СПбМО 2012","path":"data\\problems\\spbmo\\spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2012","tags":["graph_model","degree_counting","extremal_graph_theory","goal_existence","coloring","matching"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle чередующаяся рассадка 22 человек в 40-регулярном графе знакомств, спбмо 2012 spbmo спбмо 2012 graph_model degree_counting extremal_graph_theory goal_existence coloring matching карпов д.в. берлов с.л. spbmo-2012-8-p7-forty-regular-acquaintance-22-cycle chereduyuschayasya rassadka 22 chelovek v 40-regulyarnom grafe znakomstv, spbmo 2012 spbmo spbmo 2012 graph_model degree_counting extremal_graph_theory goal_existence coloring matching karpov d.v. berlov s.l."}
{"id":"spbmo-2013-10-11-girls-boys-friendship-cover","title":"Юноши, девушки и совпадающие множества подруг, СПбМО 2013, 11 класс, II тур, задача 2","path":"data\\problems\\spbmo\\spbmo-2013-10-11-girls-boys-friendship-cover.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2013-10-11-girls-boys-friendship-cover.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2013-10-11-girls-boys-friendship-cover","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2013","tags":["graph_model","pigeonhole_principle","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2013-10-11-girls-boys-friendship-cover юноши, девушки и совпадающие множества подруг, спбмо 2013, 11 класс, ii тур, задача 2 spbmo спбмо 2013 graph_model pigeonhole_principle goal_proof м. антипов spbmo-2013-10-11-girls-boys-friendship-cover yunoshi, devushki i sovpadayuschie mnozhestva podrug, spbmo 2013, 11 klass, ii tur, zadacha 2 spbmo spbmo 2013 graph_model pigeonhole_principle goal_proof m. antipov"}
{"id":"spbmo-2013-8-p5-capital-directed-disjoint-paths","title":"Близкие города, направленные дороги и непересекающиеся пути из столицы, СПбМО 2013, 8 класс, II тур, задача 5","path":"data\\problems\\spbmo\\spbmo-2013-8-p5-capital-directed-disjoint-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2013-8-p5-capital-directed-disjoint-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2013-8-p5-capital-directed-disjoint-paths","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2013","tags":["connectivity","graph_model","augmenting_path","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2013-8-p5-capital-directed-disjoint-paths близкие города, направленные дороги и непересекающиеся пути из столицы, спбмо 2013, 8 класс, ii тур, задача 5 spbmo спбмо 2013 connectivity graph_model augmenting_path goal_proof к. тыщук берлов с.л. spbmo-2013-8-p5-capital-directed-disjoint-paths blizkie goroda, napravlennye dorogi i neperesekayuschiesya puti iz stolitsy, spbmo 2013, 8 klass, ii tur, zadacha 5 spbmo spbmo 2013 connectivity graph_model augmenting_path goal_proof k. tyschuk berlov s.l."}
{"id":"spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent","title":"Базы в ориентированном графе без нечётных направленных циклов, СПбМО 2014","path":"data\\problems\\spbmo\\spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2014","tags":["connectivity","parity_coloring","induction","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent базы в ориентированном графе без нечётных направленных циклов, спбмо 2014 spbmo спбмо 2014 connectivity parity_coloring induction graph_model goal_existence н. гравин spbmo-2014-10-p7-digraph-no-odd-cycles-dominating-independent bazy v orientirovannom grafe bez nechetnyh napravlennyh tsiklov, spbmo 2014 spbmo spbmo 2014 connectivity parity_coloring induction graph_model goal_existence n. gravin"}
{"id":"spbmo-2014-11-2-maximal-matchings-delete-graph","title":"Удаление максимальных паросочетаний при степени не больше 100, СПбМО 2014, 11 класс, II тур, задача 2","path":"data\\problems\\spbmo\\spbmo-2014-11-2-maximal-matchings-delete-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2014-11-2-maximal-matchings-delete-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2014-11-2-maximal-matchings-delete-graph","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2014","tags":["matching","degree_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2014-11-2-maximal-matchings-delete-graph удаление максимальных паросочетаний при степени не больше 100, спбмо 2014, 11 класс, ii тур, задача 2 spbmo спбмо 2014 matching degree_counting goal_proof spbmo-2014-11-2-maximal-matchings-delete-graph udalenie maksimalnyh parosochetaniy pri stepeni ne bolshe 100, spbmo 2014, 11 klass, ii tur, zadacha 2 spbmo spbmo 2014 matching degree_counting goal_proof"}
{"id":"spbmo-2015-11-6-regular-graph-10-stars","title":"Разбиение 100-регулярного графа на пучки по 10 ребер, СПбМО 2015, 11 класс, II тур, задача 6","path":"data\\problems\\spbmo\\spbmo-2015-11-6-regular-graph-10-stars.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2015-11-6-regular-graph-10-stars.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2015-11-6-regular-graph-10-stars","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2015","tags":["eulerian_graphs","graph_model","invariant","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2015-11-6-regular-graph-10-stars разбиение 100-регулярного графа на пучки по 10 ребер, спбмо 2015, 11 класс, ii тур, задача 6 spbmo спбмо 2015 eulerian_graphs graph_model invariant goal_proof spbmo-2015-11-6-regular-graph-10-stars razbienie 100-regulyarnogo grafa na puchki po 10 reber, spbmo 2015, 11 klass, ii tur, zadacha 6 spbmo spbmo 2015 eulerian_graphs graph_model invariant goal_proof"}
{"id":"spbmo-2017-10-p7-remove-directed-cycle-keep-strong","title":"Удаление ориентированного цикла с сохранением сильной связности, СПбМО 2017","path":"data\\problems\\spbmo\\spbmo-2017-10-p7-remove-directed-cycle-keep-strong.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2017-10-p7-remove-directed-cycle-keep-strong.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2017-10-p7-remove-directed-cycle-keep-strong","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2017","tags":["graph_model","connectivity","extremal_choice","minimal_counterexample","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2017-10-p7-remove-directed-cycle-keep-strong удаление ориентированного цикла с сохранением сильной связности, спбмо 2017 spbmo спбмо 2017 graph_model connectivity extremal_choice minimal_counterexample goal_existence карпов д.в. spbmo-2017-10-p7-remove-directed-cycle-keep-strong udalenie orientirovannogo tsikla s sohraneniem silnoy svyaznosti, spbmo 2017 spbmo spbmo 2017 graph_model connectivity extremal_choice minimal_counterexample goal_existence karpov d.v."}
{"id":"spbmo-2017-11-p6-chordal-clique-euler-characteristic","title":"Хордальный граф знакомств, клики и эйлерова характеристика, СПбМО 2017","path":"data\\problems\\spbmo\\spbmo-2017-11-p6-chordal-clique-euler-characteristic.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2017-11-p6-chordal-clique-euler-characteristic.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2017-11-p6-chordal-clique-euler-characteristic","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2017","tags":["connectivity","graph_model","induction","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2017-11-p6-chordal-clique-euler-characteristic хордальный граф знакомств, клики и эйлерова характеристика, спбмо 2017 spbmo спбмо 2017 connectivity graph_model induction goal_counting fedor petrov spbmo-2017-11-p6-chordal-clique-euler-characteristic hordalnyy graf znakomstv, kliki i eylerova harakteristika, spbmo 2017 spbmo spbmo 2017 connectivity graph_model induction goal_counting fedor petrov"}
{"id":"spbmo-2018-10-p1-complete-graph-road-destruction-path","title":"Маршрут в полном графе при разрушении дорог, СПбМО 2018, 10 класс, II тур, задача 1","path":"data\\problems\\spbmo\\spbmo-2018-10-p1-complete-graph-road-destruction-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2018-10-p1-complete-graph-road-destruction-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2018-10-p1-complete-graph-road-destruction-path","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2018","tags":["goal_strategy_game","goal_exact_bound","pigeonhole_principle","process_invariant","graph_model"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2018-10-p1-complete-graph-road-destruction-path маршрут в полном графе при разрушении дорог, спбмо 2018, 10 класс, ii тур, задача 1 spbmo спбмо 2018 goal_strategy_game goal_exact_bound pigeonhole_principle process_invariant graph_model п. ходунов а. кузнецов и. лосев spbmo-2018-10-p1-complete-graph-road-destruction-path marshrut v polnom grafe pri razrushenii dorog, spbmo 2018, 10 klass, ii tur, zadacha 1 spbmo spbmo 2018 goal_strategy_game goal_exact_bound pigeonhole_principle process_invariant graph_model p. hodunov a. kuznetsov i. losev"}
{"id":"spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths","title":"Автобусный граф с простыми путями длины 100 и запретом нечётного цикла, СПбМО 2018","path":"data\\problems\\spbmo\\spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2018","tags":["connectivity","construction","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths автобусный граф с простыми путями длины 100 и запретом нечётного цикла, спбмо 2018 spbmo спбмо 2018 connectivity construction goal_classification а. солынин а. чухнов spbmo-2018-7-p7-bus-graph-no-odd-cycle-paths avtobusnyy graf s prostymi putyami dliny 100 i zapretom nechetnogo tsikla, spbmo 2018 spbmo spbmo 2018 connectivity construction goal_classification a. solynin a. chuhnov"}
{"id":"spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2","title":"Остовное дерево с малым числом вершин степени 2 при каждом ребре в K4, СПбМО 2018, 8 класс","path":"data\\problems\\spbmo\\spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2018","tags":["graph_model","trees","degree_counting","goal_existence","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"hard_external_theorem_no_proof","search_text":"spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2 остовное дерево с малым числом вершин степени 2 при каждом ребре в k4, спбмо 2018, 8 класс spbmo спбмо 2018 graph_model trees degree_counting goal_existence classical_theorem карпов д.в. spbmo-2018-8-p7-k4-edge-spanning-tree-few-degree2 ostovnoe derevo s malym chislom vershin stepeni 2 pri kazhdom rebre v k4, spbmo 2018, 8 klass spbmo spbmo 2018 graph_model trees degree_counting goal_existence classical_theorem karpov d.v."}
{"id":"spbmo-2019-6-8-p6-company-no-sociable-shy","title":"Компания без общительных и стеснительных людей, СПбМО 2019","path":"data\\problems\\spbmo\\spbmo-2019-6-8-p6-company-no-sociable-shy.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2019-6-8-p6-company-no-sociable-shy.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2019-6-8-p6-company-no-sociable-shy","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2019","tags":["graph_model","degree_counting","extremal_graph_theory","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2019-6-8-p6-company-no-sociable-shy компания без общительных и стеснительных людей, спбмо 2019 spbmo спбмо 2019 graph_model degree_counting extremal_graph_theory extremal_choice construction goal_exact_bound spbmo-2019-6-8-p6-company-no-sociable-shy kompaniya bez obschitelnyh i stesnitelnyh lyudey, spbmo 2019 spbmo spbmo 2019 graph_model degree_counting extremal_graph_theory extremal_choice construction goal_exact_bound"}
{"id":"spbmo-2019-9-11-p2-metro-cover-by-simple-paths","title":"Покрытие схемы метро простыми путями, СПбМО 2019","path":"data\\problems\\spbmo\\spbmo-2019-9-11-p2-metro-cover-by-simple-paths.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2019-9-11-p2-metro-cover-by-simple-paths.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2019-9-11-p2-metro-cover-by-simple-paths","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2019","tags":["connectivity","construction","extremal_choice","goal_exact_bound","graph_model","trees"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2019-9-11-p2-metro-cover-by-simple-paths покрытие схемы метро простыми путями, спбмо 2019 spbmo спбмо 2019 connectivity construction extremal_choice goal_exact_bound graph_model trees берлов с.л. spbmo-2019-9-11-p2-metro-cover-by-simple-paths pokrytie shemy metro prostymi putyami, spbmo 2019 spbmo spbmo 2019 connectivity construction extremal_choice goal_exact_bound graph_model trees berlov s.l."}
{"id":"spbmo-2019-9-11-p6-regular-graph-2-switches","title":"100-регулярные дорожные схемы и 2-перестройки, СПбМО 2019","path":"data\\problems\\spbmo\\spbmo-2019-9-11-p6-regular-graph-2-switches.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2019-9-11-p6-regular-graph-2-switches.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2019-9-11-p6-regular-graph-2-switches","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2019","tags":["graph_model","invariant","degree_counting","construction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2019-9-11-p6-regular-graph-2-switches 100-регулярные дорожные схемы и 2-перестройки, спбмо 2019 spbmo спбмо 2019 graph_model invariant degree_counting construction goal_proof т. зубов spbmo-2019-9-11-p6-regular-graph-2-switches 100-regulyarnye dorozhnye shemy i 2-perestroyki, spbmo 2019 spbmo spbmo 2019 graph_model invariant degree_counting construction goal_proof t. zubov"}
{"id":"spbmo-2020-karakatitsa-edge-weights","title":"Каракатицы в графе с весами на рёбрах, СПбМО 2019/20, 9 класс, задача 7","path":"data\\problems\\spbmo\\spbmo-2020-karakatitsa-edge-weights.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2020-karakatitsa-edge-weights.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2020-karakatitsa-edge-weights","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2020","tags":["matching","double_counting","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"spbmo-2020-karakatitsa-edge-weights каракатицы в графе с весами на рёбрах, спбмо 2019/20, 9 класс, задача 7 spbmo спбмо 2020 matching double_counting graph_model goal_bound spbmo-2020-karakatitsa-edge-weights karakatitsy v grafe s vesami na rebrah, spbmo 2019/20, 9 klass, zadacha 7 spbmo spbmo 2020 matching double_counting graph_model goal_bound"}
{"id":"spbmo-2021-coordinate-points-two-colored-2factor","title":"Расстановка знаков в 5000 точках с малыми префиксными суммами, СПбМО 2020/21, 7 класс, задача 5","path":"data\\problems\\spbmo\\spbmo-2021-coordinate-points-two-colored-2factor.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2021-coordinate-points-two-colored-2factor.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2021-coordinate-points-two-colored-2factor","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2021","tags":["graph_in_solution","matching","coloring"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"spbmo-2021-coordinate-points-two-colored-2factor расстановка знаков в 5000 точках с малыми префиксными суммами, спбмо 2020/21, 7 класс, задача 5 spbmo спбмо 2021 graph_in_solution matching coloring spbmo-2021-coordinate-points-two-colored-2factor rasstanovka znakov v 5000 tochkah s malymi prefiksnymi summami, spbmo 2020/21, 7 klass, zadacha 5 spbmo spbmo 2021 graph_in_solution matching coloring"}
{"id":"spbmo-2022-big-small-cities-spanning-forest-leaves","title":"Закрыть дороги и получить много листьев, СПбМО 2021/22, 8 класс, задача 5","path":"data\\problems\\spbmo\\spbmo-2022-big-small-cities-spanning-forest-leaves.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2022-big-small-cities-spanning-forest-leaves.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2022-big-small-cities-spanning-forest-leaves","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2022","tags":["connectivity","trees","degree_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"spbmo-2022-big-small-cities-spanning-forest-leaves закрыть дороги и получить много листьев, спбмо 2021/22, 8 класс, задача 5 spbmo спбмо 2022 connectivity trees degree_counting goal_existence spbmo-2022-big-small-cities-spanning-forest-leaves zakryt dorogi i poluchit mnogo listev, spbmo 2021/22, 8 klass, zadacha 5 spbmo spbmo 2022 connectivity trees degree_counting goal_existence"}
{"id":"spbmo-2022-eldorado-friendship-tree-potential","title":"Клуб Эльдорадо как дерево с числами на вершинах, СПбМО 2021/22, 10 класс, задача 7","path":"data\\problems\\spbmo\\spbmo-2022-eldorado-friendship-tree-potential.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2022-eldorado-friendship-tree-potential.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2022-eldorado-friendship-tree-potential","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2022","tags":["trees","potential_function","induction","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"spbmo-2022-eldorado-friendship-tree-potential клуб эльдорадо как дерево с числами на вершинах, спбмо 2021/22, 10 класс, задача 7 spbmo спбмо 2022 trees potential_function induction goal_bound spbmo-2022-eldorado-friendship-tree-potential klub eldorado kak derevo s chislami na vershinah, spbmo 2021/22, 10 klass, zadacha 7 spbmo spbmo 2022 trees potential_function induction goal_bound"}
{"id":"spbmo-2023-9-11-components-after-deleting-x-y","title":"Компоненты связности после удаления двух множеств вершин, СПбМО 2023, 11 класс, II тур, задача 7","path":"data\\problems\\spbmo\\spbmo-2023-9-11-components-after-deleting-x-y.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2023-9-11-components-after-deleting-x-y.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2023-9-11-components-after-deleting-x-y","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2023","tags":["connectivity","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2023-9-11-components-after-deleting-x-y компоненты связности после удаления двух множеств вершин, спбмо 2023, 11 класс, ii тур, задача 7 spbmo спбмо 2023 connectivity construction goal_exact_bound spbmo-2023-9-11-components-after-deleting-x-y komponenty svyaznosti posle udaleniya dvuh mnozhestv vershin, spbmo 2023, 11 klass, ii tur, zadacha 7 spbmo spbmo 2023 connectivity construction goal_exact_bound"}
{"id":"spbmo-2024-6-8-atomized-city-acquaintance-pairs","title":"Максимум пар знакомых в атомизированном городе, СПбМО 2024, 8 класс","path":"data\\problems\\spbmo\\spbmo-2024-6-8-atomized-city-acquaintance-pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2024-6-8-atomized-city-acquaintance-pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2024-6-8-atomized-city-acquaintance-pairs","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2024","tags":["graph_model","extremal_graph_theory","trees","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2024-6-8-atomized-city-acquaintance-pairs максимум пар знакомых в атомизированном городе, спбмо 2024, 8 класс spbmo спбмо 2024 graph_model extremal_graph_theory trees induction goal_exact_bound spbmo-2024-6-8-atomized-city-acquaintance-pairs maksimum par znakomyh v atomizirovannom gorode, spbmo 2024, 8 klass spbmo spbmo 2024 graph_model extremal_graph_theory trees induction goal_exact_bound"}
{"id":"spbmo-2024-9-11-metric-path-with-shortcuts","title":"Разбиение связного метро на простые линии с ограничением пересадок, СПбМО 2024, 9 класс","path":"data\\problems\\spbmo\\spbmo-2024-9-11-metric-path-with-shortcuts.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2024-9-11-metric-path-with-shortcuts.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2024-9-11-metric-path-with-shortcuts","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2024","tags":["graph_model","trees","connectivity","construction","induction","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2024-9-11-metric-path-with-shortcuts разбиение связного метро на простые линии с ограничением пересадок, спбмо 2024, 9 класс spbmo спбмо 2024 graph_model trees connectivity construction induction extremal_choice goal_exact_bound spbmo-2024-9-11-metric-path-with-shortcuts razbienie svyaznogo metro na prostye linii s ogranicheniem peresadok, spbmo 2024, 9 klass spbmo spbmo 2024 graph_model trees connectivity construction induction extremal_choice goal_exact_bound"}
{"id":"spbmo-2024-9-11-metro-lines-transfer-bound","title":"Разбиение связного метро на простые линии с ограничением числа пересадок, СПбМО 2024, 9 класс","path":"data\\problems\\spbmo\\spbmo-2024-9-11-metro-lines-transfer-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/spbmo/spbmo-2024-9-11-metro-lines-transfer-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#spbmo-2024-9-11-metro-lines-transfer-bound","source_key":"spbmo","source_keys":["spbmo"],"source_label":"СПбМО","year":"2024","tags":["graph_model","trees","connectivity","construction","induction","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"spbmo-2024-9-11-metro-lines-transfer-bound разбиение связного метро на простые линии с ограничением числа пересадок, спбмо 2024, 9 класс spbmo спбмо 2024 graph_model trees connectivity construction induction extremal_choice goal_exact_bound spbmo-2024-9-11-metro-lines-transfer-bound razbienie svyaznogo metro na prostye linii s ogranicheniem chisla peresadok, spbmo 2024, 9 klass spbmo spbmo 2024 graph_model trees connectivity construction induction extremal_choice goal_exact_bound"}
{"id":"stiebitz-double-critical-k5","title":"Теорема Штибица о дважды критических 5-хроматических графах","path":"data\\problems\\classical\\stiebitz-double-critical-k5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/stiebitz-double-critical-k5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#stiebitz-double-critical-k5","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["coloring","forbidden_clique","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"stiebitz-double-critical-k5 теорема штибица о дважды критических 5-хроматических графах misc прочее coloring forbidden_clique classical_theorem goal_characterization michael stiebitz stiebitz-double-critical-k5 teorema shtibitsa o dvazhdy kriticheskih 5-hromaticheskih grafah misc prochee coloring forbidden_clique classical_theorem goal_characterization michael stiebitz"}
{"id":"sums-2005-p6-powers-of-two-integer-graph-ball-complement","title":"Дополнение шара в графе целых чисел со степенными шагами, SUMS 2005/6","path":"data\\problems\\sums\\sums-2005-p6-powers-of-two-integer-graph-ball-complement.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2005-p6-powers-of-two-integer-graph-ball-complement.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2005-p6-powers-of-two-integer-graph-ball-complement","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2005","tags":["connectivity","minimal_counterexample","construction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2005-p6-powers-of-two-integer-graph-ball-complement дополнение шара в графе целых чисел со степенными шагами, sums 2005/6 sums sums 2005 connectivity minimal_counterexample construction goal_proof sums-2005-p6-powers-of-two-integer-graph-ball-complement dopolnenie shara v grafe tselyh chisel so stepennymi shagami, sums 2005/6 sums sums 2005 connectivity minimal_counterexample construction goal_proof"}
{"id":"sums-2007-p4-tree-induced-components-sum","title":"Сумма числа компонент по всем k-вершинным подмножествам дерева, SUMS 2007/4","path":"data\\problems\\sums\\sums-2007-p4-tree-induced-components-sum.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2007-p4-tree-induced-components-sum.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2007-p4-tree-induced-components-sum","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2007","tags":["trees","double_counting","degree_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2007-p4-tree-induced-components-sum сумма числа компонент по всем k-вершинным подмножествам дерева, sums 2007/4 sums sums 2007 trees double_counting degree_counting goal_counting sums-2007-p4-tree-induced-components-sum summa chisla komponent po vsem k-vershinnym podmnozhestvam dereva, sums 2007/4 sums sums 2007 trees double_counting degree_counting goal_counting"}
{"id":"sums-2011-p8-periodic-hexagon-tessellation-even-vertices","title":"Периодическая гексагональная тесселяция с заданными вершинами, SUMS 2011/8","path":"data\\problems\\sums\\sums-2011-p8-periodic-hexagon-tessellation-even-vertices.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2011-p8-periodic-hexagon-tessellation-even-vertices.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2011-p8-periodic-hexagon-tessellation-even-vertices","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2011","tags":["planar_graphs","degree_counting","double_counting","construction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2011-p8-periodic-hexagon-tessellation-even-vertices периодическая гексагональная тесселяция с заданными вершинами, sums 2011/8 sums sums 2011 planar_graphs degree_counting double_counting construction goal_characterization sums-2011-p8-periodic-hexagon-tessellation-even-vertices periodicheskaya geksagonalnaya tesselyatsiya s zadannymi vershinami, sums 2011/8 sums sums 2011 planar_graphs degree_counting double_counting construction goal_characterization"}
{"id":"sums-2012-p7-tree-connected-subsets-extrema","title":"Минимум и максимум числа связных подмножеств вершин дерева, SUMS 2012/7","path":"data\\problems\\sums\\sums-2012-p7-tree-connected-subsets-extrema.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2012-p7-tree-connected-subsets-extrema.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2012-p7-tree-connected-subsets-extrema","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2012","tags":["trees","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2012-p7-tree-connected-subsets-extrema минимум и максимум числа связных подмножеств вершин дерева, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound sums-2012-p7-tree-connected-subsets-extrema minimum i maksimum chisla svyaznyh podmnozhestv vershin dereva, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound"}
{"id":"sums-2012-p7-tree-connected-subsets-maximum","title":"Максимум числа связных подмножеств вершин дерева, SUMS 2012/7","path":"data\\problems\\sums\\sums-2012-p7-tree-connected-subsets-maximum.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2012-p7-tree-connected-subsets-maximum.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2012-p7-tree-connected-subsets-maximum","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2012","tags":["trees","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2012-p7-tree-connected-subsets-maximum максимум числа связных подмножеств вершин дерева, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound sums-2012-p7-tree-connected-subsets-maximum maksimum chisla svyaznyh podmnozhestv vershin dereva, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound"}
{"id":"sums-2012-p7-tree-connected-subsets-minimum","title":"Минимум числа связных подмножеств вершин дерева, SUMS 2012/7","path":"data\\problems\\sums\\sums-2012-p7-tree-connected-subsets-minimum.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2012-p7-tree-connected-subsets-minimum.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2012-p7-tree-connected-subsets-minimum","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2012","tags":["trees","extremal_choice","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2012-p7-tree-connected-subsets-minimum минимум числа связных подмножеств вершин дерева, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound sums-2012-p7-tree-connected-subsets-minimum minimum chisla svyaznyh podmnozhestv vershin dereva, sums 2012/7 sums sums 2012 trees extremal_choice construction goal_exact_bound"}
{"id":"sums-2012-p8-regular-tree-allowable-automorphisms","title":"Три допустимых автоморфизма 3-регулярного дерева между двумя вершинами, SUMS 2012/8","path":"data\\problems\\sums\\sums-2012-p8-regular-tree-allowable-automorphisms.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2012-p8-regular-tree-allowable-automorphisms.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2012-p8-regular-tree-allowable-automorphisms","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2012","tags":["trees","graph_symmetry","induction","minimal_counterexample","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2012-p8-regular-tree-allowable-automorphisms три допустимых автоморфизма 3-регулярного дерева между двумя вершинами, sums 2012/8 sums sums 2012 trees graph_symmetry induction minimal_counterexample goal_counting sums-2012-p8-regular-tree-allowable-automorphisms tri dopustimyh avtomorfizma 3-regulyarnogo dereva mezhdu dvumya vershinami, sums 2012/8 sums sums 2012 trees graph_symmetry induction minimal_counterexample goal_counting"}
{"id":"sums-2014-p6-positive-labels-dynkin-trees","title":"Положительные разметки графа с суммой соседей 2f(v)-1, SUMS 2014/6","path":"data\\problems\\sums\\sums-2014-p6-positive-labels-dynkin-trees.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/sums/sums-2014-p6-positive-labels-dynkin-trees.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#sums-2014-p6-positive-labels-dynkin-trees","source_key":"sums","source_keys":["sums"],"source_label":"SUMS","year":"2014","tags":["trees","graph_symmetry","extremal_choice","induction","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"sums-2014-p6-positive-labels-dynkin-trees положительные разметки графа с суммой соседей 2f(v)-1, sums 2014/6 sums sums 2014 trees graph_symmetry extremal_choice induction goal_classification sums-2014-p6-positive-labels-dynkin-trees polozhitelnye razmetki grafa s summoy sosedey 2f(v)-1, sums 2014/6 sums sums 2014 trees graph_symmetry extremal_choice induction goal_classification"}
{"id":"tc-1980-distinct-rows-delete-column","title":"Удаление столбца при различных строках, Олимпиада трёх городов 1980","path":"data\\problems\\tournament-cities\\tc-1980-distinct-rows-delete-column.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-1980-distinct-rows-delete-column.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-1980-distinct-rows-delete-column","source_key":"tc","source_keys":["tc"],"source_label":"Олимпиада трёх городов","year":"1980","tags":["trees","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-1980-distinct-rows-delete-column удаление столбца при различных строках, олимпиада трёх городов 1980 tc олимпиада трёх городов 1980 trees extremal_choice goal_exact_bound анджанс а. tc-1980-distinct-rows-delete-column udalenie stolbtsa pri razlichnyh strokah, olimpiada treh gorodov 1980 tc olimpiada treh gorodov 1980 trees extremal_choice goal_exact_bound andzhans a."}
{"id":"tc-1994-95-common-grandfather-intersecting-edges","title":"Общий дед и пересекающиеся рёбра, Турнир городов 1994/95","path":"data\\problems\\tournament-cities\\tc-1994-95-common-grandfather-intersecting-edges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-1994-95-common-grandfather-intersecting-edges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-1994-95-common-grandfather-intersecting-edges","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"1994","tags":["matching","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-1994-95-common-grandfather-intersecting-edges общий дед и пересекающиеся рёбра, турнир городов 1994/95 tc турнир городов 1994 matching double_counting goal_exact_bound шаповалов а.в. tc-1994-95-common-grandfather-intersecting-edges obschiy ded i peresekayuschiesya rebra, turnir gorodov 1994/95 tc turnir gorodov 1994 matching double_counting goal_exact_bound shapovalov a.v."}
{"id":"tc-2001-02-rooks-odd-attacks","title":"Ладьи, бьющие нечётное число ранее поставленных, Турнир городов 2001/02","path":"data\\problems\\tournament-cities\\tc-2001-02-rooks-odd-attacks.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2001-02-rooks-odd-attacks.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2001-02-rooks-odd-attacks","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2001","tags":["double_counting","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2001-02-rooks-odd-attacks ладьи, бьющие нечётное число ранее поставленных, турнир городов 2001/02 tc турнир городов 2001 double_counting extremal_choice goal_exact_bound шаповалов а.в. tc-2001-02-rooks-odd-attacks ladi, byuschie nechetnoe chislo ranee postavlennyh, turnir gorodov 2001/02 tc turnir gorodov 2001 double_counting extremal_choice goal_exact_bound shapovalov a.v."}
{"id":"tc-2009-10-acquaintances-even-cycle","title":"Чётный круг знакомых, Турнир городов 2009/10","path":"data\\problems\\tournament-cities\\tc-2009-10-acquaintances-even-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2009-10-acquaintances-even-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2009-10-acquaintances-even-cycle","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2009","tags":["extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2009-10-acquaintances-even-cycle чётный круг знакомых, турнир городов 2009/10 tc турнир городов 2009 extremal_choice goal_exact_bound tc-2009-10-acquaintances-even-cycle chetnyy krug znakomyh, turnir gorodov 2009/10 tc turnir gorodov 2009 extremal_choice goal_exact_bound"}
{"id":"tc-2010-11-odd-main-roads","title":"Главные дороги нечётной степени, Турнир городов 2010/11","path":"data\\problems\\tournament-cities\\tc-2010-11-odd-main-roads.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2010-11-odd-main-roads.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2010-11-odd-main-roads","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2010","tags":["connectivity","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2010-11-odd-main-roads главные дороги нечётной степени, турнир городов 2010/11 tc турнир городов 2010 connectivity double_counting goal_counting грибалко а.в. tc-2010-11-odd-main-roads glavnye dorogi nechetnoy stepeni, turnir gorodov 2010/11 tc turnir gorodov 2010 connectivity double_counting goal_counting gribalko a.v."}
{"id":"tc-2011-ants-two-hamiltonian-cycles-grid","title":"Два муравья и два замкнутых обхода доски 7x7, Турнир городов 2010/11","path":"data\\problems\\tournament-cities\\tc-2011-ants-two-hamiltonian-cycles-grid.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2011-ants-two-hamiltonian-cycles-grid.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2011-ants-two-hamiltonian-cycles-grid","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2011","tags":["graph_model","hamiltonian_cycles","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2011-ants-two-hamiltonian-cycles-grid два муравья и два замкнутых обхода доски 7x7, турнир городов 2010/11 tc турнир городов 2011 graph_model hamiltonian_cycles goal_exact_bound заславский а.а. tc-2011-ants-two-hamiltonian-cycles-grid dva muravya i dva zamknutyh obhoda doski 7x7, turnir gorodov 2010/11 tc turnir gorodov 2011 graph_model hamiltonian_cycles goal_exact_bound zaslavskiy a.a."}
{"id":"tc-2012-polyhedron-three-equal-edges","title":"Три равных ребра кубического многогранника, Турнир городов 2011/12","path":"data\\problems\\tournament-cities\\tc-2012-polyhedron-three-equal-edges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2012-polyhedron-three-equal-edges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2012-polyhedron-three-equal-edges","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2012","tags":["planar_graphs","degree_counting","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"tc-2012-polyhedron-three-equal-edges три равных ребра кубического многогранника, турнир городов 2011/12 tc турнир городов 2012 planar_graphs degree_counting graph_model произволов в. в. tc-2012-polyhedron-three-equal-edges tri ravnyh rebra kubicheskogo mnogogrannika, turnir gorodov 2011/12 tc turnir gorodov 2012 planar_graphs degree_counting graph_model proizvolov v. v."}
{"id":"tc-2013-14-vertex-transitive-not-transposition","title":"Перенумерация городов без произвольной перестановки пары, Турнир городов 2013/14","path":"data\\problems\\tournament-cities\\tc-2013-14-vertex-transitive-not-transposition.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2013-14-vertex-transitive-not-transposition.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2013-14-vertex-transitive-not-transposition","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2013","tags":["graph_symmetry","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2013-14-vertex-transitive-not-transposition перенумерация городов без произвольной перестановки пары, турнир городов 2013/14 tc турнир городов 2013 graph_symmetry goal_characterization пахарев а. скопенков м.б. устинов а.в. tc-2013-14-vertex-transitive-not-transposition perenumeratsiya gorodov bez proizvolnoy perestanovki pary, turnir gorodov 2013/14 tc turnir gorodov 2013 graph_symmetry goal_characterization paharev a. skopenkov m.b. ustinov a.v."}
{"id":"tc-2015-16-connectivity-query-lower-bound","title":"Проверка связности за вопросы о дорогах, Турнир городов 2015/16","path":"data\\problems\\tournament-cities\\tc-2015-16-connectivity-query-lower-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2015-16-connectivity-query-lower-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2015-16-connectivity-query-lower-bound","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2015","tags":["connectivity","trees","goal_exact_bound"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2015-16-connectivity-query-lower-bound проверка связности за вопросы о дорогах, турнир городов 2015/16 tc турнир городов 2015 connectivity trees goal_exact_bound кноп к.а. tc-2015-16-connectivity-query-lower-bound proverka svyaznosti za voprosy o dorogah, turnir gorodov 2015/16 tc turnir gorodov 2015 connectivity trees goal_exact_bound knop k.a."}
{"id":"tc-2016-tennis-masters-juniors-regular-bipartite","title":"Теннисисты-мастера и юниоры, Турнир городов 2015/16","path":"data\\problems\\tournament-cities\\tc-2016-tennis-masters-juniors-regular-bipartite.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2016-tennis-masters-juniors-regular-bipartite.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2016-tennis-masters-juniors-regular-bipartite","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2016","tags":["graph_model","degree_counting","matching","double_counting","invariant","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original_checked","search_text":"tc-2016-tennis-masters-juniors-regular-bipartite теннисисты-мастера и юниоры, турнир городов 2015/16 tc турнир городов 2016 graph_model degree_counting matching double_counting invariant goal_existence грибалко а.в. tc-2016-tennis-masters-juniors-regular-bipartite tennisisty-mastera i yuniory, turnir gorodov 2015/16 tc turnir gorodov 2016 graph_model degree_counting matching double_counting invariant goal_existence gribalko a.v."}
{"id":"tc-2017-18-polyhedron-three-colors-parity","title":"Трёхцветные вершины многогранника, Турнир городов 2017/18","path":"data\\problems\\tournament-cities\\tc-2017-18-polyhedron-three-colors-parity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2017-18-polyhedron-three-colors-parity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2017-18-polyhedron-three-colors-parity","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2017","tags":["eulerian_graphs","double_counting","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2017-18-polyhedron-three-colors-parity трёхцветные вершины многогранника, турнир городов 2017/18 tc турнир городов 2017 eulerian_graphs double_counting goal_proof бакаев е.в. грибалко а.в. раскина и.в. tc-2017-18-polyhedron-three-colors-parity trehtsvetnye vershiny mnogogrannika, turnir gorodov 2017/18 tc turnir gorodov 2017 eulerian_graphs double_counting goal_proof bakaev e.v. gribalko a.v. raskina i.v."}
{"id":"tc-2017-pingpong-same-pairs-tournament-graph","title":"Пинг-понг навылет и кубок с теми же парами, Турнир городов 2016/17","path":"data\\problems\\tournament-cities\\tc-2017-pingpong-same-pairs-tournament-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2017-pingpong-same-pairs-tournament-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2017-pingpong-same-pairs-tournament-graph","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2017","tags":["graph_in_solution","connectivity","degree_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2017-pingpong-same-pairs-tournament-graph пинг-понг навылет и кубок с теми же парами, турнир городов 2016/17 tc турнир городов 2017 graph_in_solution connectivity degree_counting френкин б.р. tc-2017-pingpong-same-pairs-tournament-graph ping-pong navylet i kubok s temi zhe parami, turnir gorodov 2016/17 tc turnir gorodov 2017 graph_in_solution connectivity degree_counting frenkin b.r."}
{"id":"tc-2018-19-complex-state-cycle-game","title":"Сложное государство: выигрыш Васи, Турнир городов 2018/19","path":"data\\problems\\tournament-cities\\tc-2018-19-complex-state-cycle-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2018-19-complex-state-cycle-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2018-19-complex-state-cycle-game","source_key":"tc","source_keys":["tc","lktg"],"source_label":"Турнир городов","year":"2018","tags":["connectivity","induction","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2018-19-complex-state-cycle-game сложное государство: выигрыш васи, турнир городов 2018/19 tc турнир городов 2018 connectivity induction goal_strategy_game дидин м. а. tc-2018-19-complex-state-cycle-game slozhnoe gosudarstvo: vyigrysh vasi, turnir gorodov 2018/19 tc turnir gorodov 2018 connectivity induction goal_strategy_game didin m. a."}
{"id":"tc-2018-19-simple-state-tree-game","title":"Простое государство: Петя не проигрывает, Турнир городов 2018/19","path":"data\\problems\\tournament-cities\\tc-2018-19-simple-state-tree-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2018-19-simple-state-tree-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2018-19-simple-state-tree-game","source_key":"tc","source_keys":["tc","lktg"],"source_label":"Турнир городов","year":"2018","tags":["trees","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2018-19-simple-state-tree-game простое государство: петя не проигрывает, турнир городов 2018/19 tc турнир городов 2018 trees goal_strategy_game дидин м. а. tc-2018-19-simple-state-tree-game prostoe gosudarstvo: petya ne proigryvaet, turnir gorodov 2018/19 tc turnir gorodov 2018 trees goal_strategy_game didin m. a."}
{"id":"tc-2018-cards-4x4-neighbor-numbers-graph","title":"Карточки 1-16 в таблице 4x4 и соседние числа, Турнир городов 2017/18","path":"data\\problems\\tournament-cities\\tc-2018-cards-4x4-neighbor-numbers-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2018-cards-4x4-neighbor-numbers-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2018-cards-4x4-neighbor-numbers-graph","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2018","tags":["graph_in_solution","coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2018-cards-4x4-neighbor-numbers-graph карточки 1-16 в таблице 4x4 и соседние числа, турнир городов 2017/18 tc турнир городов 2018 graph_in_solution coloring goal_exact_bound евдокимов м.а. tc-2018-cards-4x4-neighbor-numbers-graph kartochki 1-16 v tablitse 4x4 i sosednie chisla, turnir gorodov 2017/18 tc turnir gorodov 2018 graph_in_solution coloring goal_exact_bound evdokimov m.a."}
{"id":"tc-2020-21-gnomes-two-cycles-even-n","title":"Два круглых столика гномов при чётном n, Турнир городов 2020/21","path":"data\\problems\\tournament-cities\\tc-2020-21-gnomes-two-cycles-even-n.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2020-21-gnomes-two-cycles-even-n.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2020-21-gnomes-two-cycles-even-n","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2020","tags":["hamiltonian_cycles","double_counting","goal_strategy_game","goal_impossibility"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2020-21-gnomes-two-cycles-even-n два круглых столика гномов при чётном n, турнир городов 2020/21 tc турнир городов 2020 hamiltonian_cycles double_counting goal_strategy_game goal_impossibility святловский м. tc-2020-21-gnomes-two-cycles-even-n dva kruglyh stolika gnomov pri chetnom n, turnir gorodov 2020/21 tc turnir gorodov 2020 hamiltonian_cycles double_counting goal_strategy_game goal_impossibility svyatlovskiy m."}
{"id":"tc-2020-21-gnomes-two-cycles-odd-n","title":"Два круглых столика гномов при нечётном n, Турнир городов 2020/21","path":"data\\problems\\tournament-cities\\tc-2020-21-gnomes-two-cycles-odd-n.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2020-21-gnomes-two-cycles-odd-n.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2020-21-gnomes-two-cycles-odd-n","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2020","tags":["hamiltonian_cycles","goal_construction","goal_existence"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2020-21-gnomes-two-cycles-odd-n два круглых столика гномов при нечётном n, турнир городов 2020/21 tc турнир городов 2020 hamiltonian_cycles goal_construction goal_existence святловский м. tc-2020-21-gnomes-two-cycles-odd-n dva kruglyh stolika gnomov pri nechetnom n, turnir gorodov 2020/21 tc turnir gorodov 2020 hamiltonian_cycles goal_construction goal_existence svyatlovskiy m."}
{"id":"tc-2022-23-blue-red-cells-connectivity","title":"Синие и красные клетки в таблице 44 на 44, Турнир городов 2022/23","path":"data\\problems\\tournament-cities\\tc-2022-23-blue-red-cells-connectivity.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2022-23-blue-red-cells-connectivity.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2022-23-blue-red-cells-connectivity","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2022","tags":["connectivity","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2022-23-blue-red-cells-connectivity синие и красные клетки в таблице 44 на 44, турнир городов 2022/23 tc турнир городов 2022 connectivity double_counting goal_exact_bound френкин б.р. tc-2022-23-blue-red-cells-connectivity sinie i krasnye kletki v tablitse 44 na 44, turnir gorodov 2022/23 tc turnir gorodov 2022 connectivity double_counting goal_exact_bound frenkin b.r."}
{"id":"tc-2022-bug-one-way-doors-bridgeless-grid","title":"Жук и односторонние двери клетчатого квадрата, Турнир городов 2022/23","path":"data\\problems\\tournament-cities\\tc-2022-bug-one-way-doors-bridgeless-grid.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2022-bug-one-way-doors-bridgeless-grid.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2022-bug-one-way-doors-bridgeless-grid","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2022","tags":["graph_model","connectivity","graph_cut"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"tc-2022-bug-one-way-doors-bridgeless-grid жук и односторонние двери клетчатого квадрата, турнир городов 2022/23 tc турнир городов 2022 graph_model connectivity graph_cut tc-2022-bug-one-way-doors-bridgeless-grid zhuk i odnostoronnie dveri kletchatogo kvadrata, turnir gorodov 2022/23 tc turnir gorodov 2022 graph_model connectivity graph_cut"}
{"id":"tc-2022-crossword-word-cell-bipartite-graph","title":"Кроссворд и покрытие словами, Турнир городов 2021/22","path":"data\\problems\\tournament-cities\\tc-2022-crossword-word-cell-bipartite-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2022-crossword-word-cell-bipartite-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2022-crossword-word-cell-bipartite-graph","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2022","tags":["graph_in_solution","double_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2022-crossword-word-cell-bipartite-graph кроссворд и покрытие словами, турнир городов 2021/22 tc турнир городов 2022 graph_in_solution double_counting френкин б.р. tc-2022-crossword-word-cell-bipartite-graph krossvord i pokrytie slovami, turnir gorodov 2021/22 tc turnir gorodov 2022 graph_in_solution double_counting frenkin b.r."}
{"id":"tc-2023-24-coins-pairing-weighing-forest","title":"Разбить монеты на пары меньше чем за n взвешиваний, Турнир городов 2023/24","path":"data\\problems\\tournament-cities\\tc-2023-24-coins-pairing-weighing-forest.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2023-24-coins-pairing-weighing-forest.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2023-24-coins-pairing-weighing-forest","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2023","tags":["trees","goal_algorithm"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tc-2023-24-coins-pairing-weighing-forest разбить монеты на пары меньше чем за n взвешиваний, турнир городов 2023/24 tc турнир городов 2023 trees goal_algorithm грибалко а.в. tc-2023-24-coins-pairing-weighing-forest razbit monety na pary menshe chem za n vzveshivaniy, turnir gorodov 2023/24 tc turnir gorodov 2023 trees goal_algorithm gribalko a.v."}
{"id":"tc-2024-connected-paper-pieces-chessboard-coloring","title":"Связные клетчатые куски и шахматная раскраска доски 45 на 45, Турнир городов 2023/24","path":"data\\problems\\tournament-cities\\tc-2024-connected-paper-pieces-chessboard-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/tournament-cities/tc-2024-connected-paper-pieces-chessboard-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tc-2024-connected-paper-pieces-chessboard-coloring","source_key":"tc","source_keys":["tc"],"source_label":"Турнир городов","year":"2024","tags":["graph_in_solution","connectivity","coloring","potential_function","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tc-2024-connected-paper-pieces-chessboard-coloring связные клетчатые куски и шахматная раскраска доски 45 на 45, турнир городов 2023/24 tc турнир городов 2024 graph_in_solution connectivity coloring potential_function goal_exact_bound казицына т.в. tc-2024-connected-paper-pieces-chessboard-coloring svyaznye kletchatye kuski i shahmatnaya raskraska doski 45 na 45, turnir gorodov 2023/24 tc turnir gorodov 2024 graph_in_solution connectivity coloring potential_function goal_exact_bound kazitsyna t.v."}
{"id":"ternary-nonzero-strings-perfect-matching","title":"Совершенное паросочетание на ненулевых троичных строках","path":"data\\problems\\classical\\ternary-nonzero-strings-perfect-matching.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/ternary-nonzero-strings-perfect-matching.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#ternary-nonzero-strings-perfect-matching","source_key":"misc","source_keys":["misc","putnam"],"source_label":"Прочее","year":"","tags":["matching","graph_model","goal_existence","classical_lemma"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"ternary-nonzero-strings-perfect-matching совершенное паросочетание на ненулевых троичных строках misc прочее matching graph_model goal_existence classical_lemma ternary-nonzero-strings-perfect-matching sovershennoe parosochetanie na nenulevyh troichnyh strokah misc prochee matching graph_model goal_existence classical_lemma"}
{"id":"third-fourth-distance-layer-bound","title":"Оценка четвертого слоя через третий слой расстояний","path":"data\\problems\\classical\\third-fourth-distance-layer-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/third-fourth-distance-layer-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#third-fourth-distance-layer-bound","source_key":"misc","source_keys":["misc","imo"],"source_label":"Прочее","year":"","tags":["connectivity","double_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"third-fourth-distance-layer-bound оценка четвертого слоя через третий слой расстояний misc прочее connectivity double_counting goal_bound third-fourth-distance-layer-bound otsenka chetvertogo sloya cherez tretiy sloy rasstoyaniy misc prochee connectivity double_counting goal_bound"}
{"id":"tournament-hamiltonian-path","title":"В каждом турнире есть гамильтонов путь","path":"data\\problems\\classical\\tournament-hamiltonian-path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tournament-hamiltonian-path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tournament-hamiltonian-path","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["tournaments","hamiltonian_cycles","induction","classical_theorem","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tournament-hamiltonian-path в каждом турнире есть гамильтонов путь misc прочее tournaments hamiltonian_cycles induction classical_theorem goal_existence lászló rédei tournament-hamiltonian-path v kazhdom turnire est gamiltonov put misc prochee tournaments hamiltonian_cycles induction classical_theorem goal_existence lászló rédei"}
{"id":"tournament-king-radius-two","title":"В турнире есть король радиуса 2","path":"data\\problems\\classical\\tournament-king-radius-two.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tournament-king-radius-two.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tournament-king-radius-two","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["tournaments","extremal_choice","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tournament-king-radius-two в турнире есть король радиуса 2 misc прочее tournaments extremal_choice classical_theorem goal_exact_bound edmund landau tournament-king-radius-two v turnire est korol radiusa 2 misc prochee tournaments extremal_choice classical_theorem goal_exact_bound edmund landau"}
{"id":"tree-equivalent-properties","title":"Эквивалентные свойства деревьев","path":"data\\problems\\classical\\tree-equivalent-properties.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tree-equivalent-properties.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tree-equivalent-properties","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","induction","classical_theorem","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tree-equivalent-properties эквивалентные свойства деревьев misc прочее trees induction classical_theorem goal_characterization tree-equivalent-properties ekvivalentnye svoystva derevev misc prochee trees induction classical_theorem goal_characterization"}
{"id":"tree-near-perfect-matchings-path-extremal","title":"Экстремальная лемма о почти совершенных паросочетаниях в дереве","path":"data\\problems\\classical\\tree-near-perfect-matchings-path-extremal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tree-near-perfect-matchings-path-extremal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tree-near-perfect-matchings-path-extremal","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","matching","induction","extremal_choice","goal_exact_bound","goal_characterization","classical_lemma"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tree-near-perfect-matchings-path-extremal экстремальная лемма о почти совершенных паросочетаниях в дереве misc прочее trees matching induction extremal_choice goal_exact_bound goal_characterization classical_lemma tree-near-perfect-matchings-path-extremal ekstremalnaya lemma o pochti sovershennyh parosochetaniyah v dereve misc prochee trees matching induction extremal_choice goal_exact_bound goal_characterization classical_lemma"}
{"id":"tree-t-join-parity-lemma","title":"Лемма о T-соединении в дереве и нечётных степенях","path":"data\\problems\\classical\\tree-t-join-parity-lemma.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tree-t-join-parity-lemma.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tree-t-join-parity-lemma","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","goal_existence","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"tree-t-join-parity-lemma лемма о t-соединении в дереве и нечётных степенях misc прочее trees goal_existence goal_construction tree-t-join-parity-lemma lemma o t-soedinenii v dereve i nechetnyh stepenyah misc prochee trees goal_existence goal_construction"}
{"id":"tree-total-domination-two-thirds","title":"В каждом дереве есть полное доминирующее множество размера не больше \\(\\lfloor 2n/3\\rfloor\\)","path":"data\\problems\\classical\\tree-total-domination-two-thirds.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tree-total-domination-two-thirds.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tree-total-domination-two-thirds","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["trees","induction","goal_bound","goal_existence","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tree-total-domination-two-thirds в каждом дереве есть полное доминирующее множество размера не больше \\(\\lfloor 2n/3\\rfloor\\) misc прочее trees induction goal_bound goal_existence goal_construction tree-total-domination-two-thirds v kazhdom dereve est polnoe dominiruyuschee mnozhestvo razmera ne bolshe \\(\\lfloor 2n/3\\rfloor\\) misc prochee trees induction goal_bound goal_existence goal_construction"}
{"id":"tree-vs-independent-set-ramsey-bound","title":"Рамсеевская граница для дерева и независимого множества","path":"data\\problems\\classical\\tree-vs-independent-set-ramsey-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/tree-vs-independent-set-ramsey-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#tree-vs-independent-set-ramsey-bound","source_key":"misc","source_keys":["misc","fyum"],"source_label":"Прочее","year":"","tags":["ramsey_theory","trees","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"tree-vs-independent-set-ramsey-bound рамсеевская граница для дерева и независимого множества misc прочее ramsey_theory trees induction goal_exact_bound tree-vs-independent-set-ramsey-bound ramseevskaya granitsa dlya dereva i nezavisimogo mnozhestva misc prochee ramsey_theory trees induction goal_exact_bound"}
{"id":"turan-theorem","title":"Теорема Турана о максимуме рёбер без клики","path":"data\\problems\\classical\\turan-theorem.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/turan-theorem.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#turan-theorem","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["extremal_graph_theory","forbidden_clique","symmetrization","classical_theorem","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"turan-theorem теорема турана о максимуме рёбер без клики misc прочее extremal_graph_theory forbidden_clique symmetrization classical_theorem goal_exact_bound pál turán turan-theorem teorema turana o maksimume reber bez kliki misc prochee extremal_graph_theory forbidden_clique symmetrization classical_theorem goal_exact_bound pál turán"}
{"id":"two-vertex-connected-graphs-have-no-bridges","title":"В 2-вершинно-связном графе нет мостов","path":"data\\problems\\classical\\two-vertex-connected-graphs-have-no-bridges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/two-vertex-connected-graphs-have-no-bridges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#two-vertex-connected-graphs-have-no-bridges","source_key":"misc","source_keys":["misc"],"source_label":"Прочее","year":"","tags":["connectivity","classical_lemma","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_self_contained","search_text":"two-vertex-connected-graphs-have-no-bridges в 2-вершинно-связном графе нет мостов misc прочее connectivity classical_lemma goal_characterization two-vertex-connected-graphs-have-no-bridges v 2-vershinno-svyaznom grafe net mostov misc prochee connectivity classical_lemma goal_characterization"}
{"id":"unique-insertion-interval-oriented-triples","title":"Единственный промежуток вставки для ориентированных троек","path":"data\\problems\\classical\\unique-insertion-interval-oriented-triples.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/unique-insertion-interval-oriented-triples.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#unique-insertion-interval-oriented-triples","source_key":"misc","source_keys":["misc","putnam"],"source_label":"Прочее","year":"","tags":["tournaments","induction","classical_lemma","goal_existence","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"unique-insertion-interval-oriented-triples единственный промежуток вставки для ориентированных троек misc прочее tournaments induction classical_lemma goal_existence goal_characterization unique-insertion-interval-oriented-triples edinstvennyy promezhutok vstavki dlya orientirovannyh troek misc prochee tournaments induction classical_lemma goal_existence goal_characterization"}
{"id":"usa-tst-2005-p1-set-system-incidence-graph","title":"Система из 2n подмножеств и граф пересечений, USA TST 2005 P1","path":"data\\problems\\usa-tst\\usa-tst-2005-p1-set-system-incidence-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usa-tst/usa-tst-2005-p1-set-system-incidence-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usa-tst-2005-p1-set-system-incidence-graph","source_key":"usa","source_keys":["usa"],"source_label":"USA TST","year":"2005","tags":["extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"usa-tst-2005-p1-set-system-incidence-graph система из 2n подмножеств и граф пересечений, usa tst 2005 p1 usa usa tst 2005 extremal_choice goal_exact_bound usa-tst-2005-p1-set-system-incidence-graph sistema iz 2n podmnozhestv i graf peresecheniy, usa tst 2005 p1 usa usa tst 2005 extremal_choice goal_exact_bound"}
{"id":"usa-tst-2009-p6-tournament-gap-ordering","title":"Турнир с M-шаговой транзитивностью, USA TST 2009 P6","path":"data\\problems\\usa-tst\\usa-tst-2009-p6-tournament-gap-ordering.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usa-tst/usa-tst-2009-p6-tournament-gap-ordering.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usa-tst-2009-p6-tournament-gap-ordering","source_key":"usa","source_keys":["usa","fyum"],"source_label":"USA TST","year":"2009","tags":["tournaments","connectivity","hamiltonian_cycles","goal_proof"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usa-tst-2009-p6-tournament-gap-ordering турнир с m-шаговой транзитивностью, usa tst 2009 p6 usa usa tst 2009 tournaments connectivity hamiltonian_cycles goal_proof gabriel carroll usa-tst-2009-p6-tournament-gap-ordering turnir s m-shagovoy tranzitivnostyu, usa tst 2009 p6 usa usa tst 2009 tournaments connectivity hamiltonian_cycles goal_proof gabriel carroll"}
{"id":"usa-tst-2011-p2-weighted-road-orientation","title":"Ориентация рёбер веса 1 и 2 при нечётных взвешенных степенях","path":"data\\problems\\usa-tst\\usa-tst-2011-p2-weighted-road-orientation.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usa-tst/usa-tst-2011-p2-weighted-road-orientation.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usa-tst-2011-p2-weighted-road-orientation","source_key":"usa","source_keys":["usa"],"source_label":"USA","year":"2011","tags":["eulerian_graphs","construction","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"self_contained","search_text":"usa-tst-2011-p2-weighted-road-orientation ориентация рёбер веса 1 и 2 при нечётных взвешенных степенях usa usa 2011 eulerian_graphs construction goal_proof zuming feng yufei zhao usa-tst-2011-p2-weighted-road-orientation orientatsiya reber vesa 1 i 2 pri nechetnyh vzveshennyh stepenyah usa usa 2011 eulerian_graphs construction goal_proof zuming feng yufei zhao"}
{"id":"usa-tst-2013-dec-p1-language-club-rainbow-triangles","title":"Языки в клубе и радужные тройки, USA TST 2013 December P1","path":"data\\problems\\usa-tst\\usa-tst-2013-dec-p1-language-club-rainbow-triangles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usa-tst/usa-tst-2013-dec-p1-language-club-rainbow-triangles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usa-tst-2013-dec-p1-language-club-rainbow-triangles","source_key":"usa","source_keys":["usa"],"source_label":"USA TST","year":"2013","tags":["double_counting","ramsey_theory","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"usa-tst-2013-dec-p1-language-club-rainbow-triangles языки в клубе и радужные тройки, usa tst 2013 december p1 usa usa tst 2013 double_counting ramsey_theory extremal_choice goal_exact_bound usa-tst-2013-dec-p1-language-club-rainbow-triangles yazyki v klube i raduzhnye troyki, usa tst 2013 december p1 usa usa tst 2013 double_counting ramsey_theory extremal_choice goal_exact_bound"}
{"id":"usajmo-2023-p3-domino-slides-special-square-digraph","title":"Слайды домино, USAJMO 2023 P3","path":"data\\problems\\usajmo\\usajmo-2023-p3-domino-slides-special-square-digraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usajmo/usajmo-2023-p3-domino-slides-special-square-digraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usajmo-2023-p3-domino-slides-special-square-digraph","source_key":"usajmo","source_keys":["usajmo","usamo"],"source_label":"USAJMO","year":"2023","tags":["trees","coloring","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usajmo-2023-p3-domino-slides-special-square-digraph слайды домино, usajmo 2023 p3 usajmo usajmo 2023 trees coloring goal_exact_bound holden mui usajmo-2023-p3-domino-slides-special-square-digraph slaydy domino, usajmo 2023 p3 usajmo usajmo 2023 trees coloring goal_exact_bound holden mui"}
{"id":"usamo-1976-p1-monochromatic-rectangle-bipartite","title":"Монохроматический прямоугольник на доске 4x7, USAMO 1976 P1","path":"data\\problems\\usamo\\usamo-1976-p1-monochromatic-rectangle-bipartite.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-1976-p1-monochromatic-rectangle-bipartite.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-1976-p1-monochromatic-rectangle-bipartite","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"1976","tags":["double_counting","coloring","ramsey_theory","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-1976-p1-monochromatic-rectangle-bipartite монохроматический прямоугольник на доске 4x7, usamo 1976 p1 usamo usamo 1976 double_counting coloring ramsey_theory goal_counting usamo-1976-p1-monochromatic-rectangle-bipartite monohromaticheskiy pryamougolnik na doske 4x7, usamo 1976 p1 usamo usamo 1976 double_counting coloring ramsey_theory goal_counting"}
{"id":"usamo-1976-p1a-4x7-monochromatic-rectangle-forcing","title":"Неизбежный монохроматический прямоугольник на доске 4x7, USAMO 1976 P1a","path":"data\\problems\\usamo\\usamo-1976-p1a-4x7-monochromatic-rectangle-forcing.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-1976-p1a-4x7-monochromatic-rectangle-forcing.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-1976-p1a-4x7-monochromatic-rectangle-forcing","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"1976","tags":["double_counting","coloring","ramsey_theory","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-1976-p1a-4x7-monochromatic-rectangle-forcing неизбежный монохроматический прямоугольник на доске 4x7, usamo 1976 p1a usamo usamo 1976 double_counting coloring ramsey_theory goal_existence usamo-1976-p1a-4x7-monochromatic-rectangle-forcing neizbezhnyy monohromaticheskiy pryamougolnik na doske 4x7, usamo 1976 p1a usamo usamo 1976 double_counting coloring ramsey_theory goal_existence"}
{"id":"usamo-1976-p1b-4x6-rectangle-free-coloring-construction","title":"Раскраска доски 4x6 без монохроматического прямоугольника, USAMO 1976 P1b","path":"data\\problems\\usamo\\usamo-1976-p1b-4x6-rectangle-free-coloring-construction.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-1976-p1b-4x6-rectangle-free-coloring-construction.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-1976-p1b-4x6-rectangle-free-coloring-construction","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"1976","tags":["coloring","construction","ramsey_theory","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-1976-p1b-4x6-rectangle-free-coloring-construction раскраска доски 4x6 без монохроматического прямоугольника, usamo 1976 p1b usamo usamo 1976 coloring construction ramsey_theory goal_construction usamo-1976-p1b-4x6-rectangle-free-coloring-construction raskraska doski 4x6 bez monohromaticheskogo pryamougolnika, usamo 1976 p1b usamo usamo 1976 coloring construction ramsey_theory goal_construction"}
{"id":"usamo-1999-p1-checkers-board-graph-rank","title":"Шашки на доске и граф занятых клеток, USAMO 1999 P1","path":"data\\problems\\usamo\\usamo-1999-p1-checkers-board-graph-rank.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-1999-p1-checkers-board-graph-rank.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-1999-p1-checkers-board-graph-rank","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"1999","tags":["double_counting","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-1999-p1-checkers-board-graph-rank шашки на доске и граф занятых клеток, usamo 1999 p1 usamo usamo 1999 double_counting extremal_choice goal_exact_bound usamo-1999-p1-checkers-board-graph-rank shashki na doske i graf zanyatyh kletok, usamo 1999 p1 usamo usamo 1999 double_counting extremal_choice goal_exact_bound"}
{"id":"usamo-2004-p4-black-path-grid-game","title":"Чёрный путь на сетке 6x6 после игры, USAMO 2004 P4","path":"data\\problems\\usamo\\usamo-2004-p4-black-path-grid-game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2004-p4-black-path-grid-game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2004-p4-black-path-grid-game","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2004","tags":["extremal_choice","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-2004-p4-black-path-grid-game чёрный путь на сетке 6x6 после игры, usamo 2004 p4 usamo usamo 2004 extremal_choice goal_strategy_game melanie wood usamo-2004-p4-black-path-grid-game chernyy put na setke 6x6 posle igry, usamo 2004 p4 usamo usamo 2004 extremal_choice goal_strategy_game melanie wood"}
{"id":"usamo-2008-p3-diamond-lattice-path-partition","title":"Разбиение ромбовидной решётки на пути, USAMO 2008 P3","path":"data\\problems\\usamo\\usamo-2008-p3-diamond-lattice-path-partition.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2008-p3-diamond-lattice-path-partition.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2008-p3-diamond-lattice-path-partition","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2008","tags":["coloring","parity_coloring","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-2008-p3-diamond-lattice-path-partition разбиение ромбовидной решётки на пути, usamo 2008 p3 usamo usamo 2008 coloring parity_coloring goal_bound gabriel carroll usamo-2008-p3-diamond-lattice-path-partition razbienie rombovidnoy reshetki na puti, usamo 2008 p3 usamo usamo 2008 coloring parity_coloring goal_bound gabriel carroll"}
{"id":"usamo-2008-p6-even-friends-two-rooms","title":"Две комнаты и чётное число друзей, USAMO 2008 P6","path":"data\\problems\\usamo\\usamo-2008-p6-even-friends-two-rooms.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2008-p6-even-friends-two-rooms.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2008-p6-even-friends-two-rooms","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2008","tags":["coloring","graph_symmetry","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"usamo-2008-p6-even-friends-two-rooms две комнаты и чётное число друзей, usamo 2008 p6 usamo usamo 2008 coloring graph_symmetry goal_counting sam vandervelde usamo-2008-p6-even-friends-two-rooms dve komnaty i chetnoe chislo druzey, usamo 2008 p6 usamo usamo 2008 coloring graph_symmetry goal_counting sam vandervelde"}
{"id":"usamo-2009-p3-tasteful-domino-tiling-alternating-cycles","title":"Изящные домино-разбиения шахматного многоугольника, USAMO 2009 P3","path":"data\\problems\\usamo\\usamo-2009-p3-tasteful-domino-tiling-alternating-cycles.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2009-p3-tasteful-domino-tiling-alternating-cycles.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2009-p3-tasteful-domino-tiling-alternating-cycles","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2009","tags":["matching","planar_graphs","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2009-p3-tasteful-domino-tiling-alternating-cycles изящные домино-разбиения шахматного многоугольника, usamo 2009 p3 usamo usamo 2009 matching planar_graphs goal_characterization sam vandervelde usamo-2009-p3-tasteful-domino-tiling-alternating-cycles izyaschnye domino-razbieniya shahmatnogo mnogougolnika, usamo 2009 p3 usamo usamo 2009 matching planar_graphs goal_characterization sam vandervelde"}
{"id":"usamo-2009-p3-tasteful-domino-tiling-existence","title":"Существование изящного домино-разбиения, USAMO 2009 P3(a)","path":"data\\problems\\usamo\\usamo-2009-p3-tasteful-domino-tiling-existence.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2009-p3-tasteful-domino-tiling-existence.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2009-p3-tasteful-domino-tiling-existence","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2009","tags":["matching","induction","extremal_choice","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2009-p3-tasteful-domino-tiling-existence существование изящного домино-разбиения, usamo 2009 p3(a) usamo usamo 2009 matching induction extremal_choice goal_existence sam vandervelde usamo-2009-p3-tasteful-domino-tiling-existence suschestvovanie izyaschnogo domino-razbieniya, usamo 2009 p3(a) usamo usamo 2009 matching induction extremal_choice goal_existence sam vandervelde"}
{"id":"usamo-2009-p3-tasteful-domino-tiling-uniqueness","title":"Единственность изящного домино-разбиения, USAMO 2009 P3(b)","path":"data\\problems\\usamo\\usamo-2009-p3-tasteful-domino-tiling-uniqueness.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2009-p3-tasteful-domino-tiling-uniqueness.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2009-p3-tasteful-domino-tiling-uniqueness","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2009","tags":["matching","planar_graphs","extremal_choice","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2009-p3-tasteful-domino-tiling-uniqueness единственность изящного домино-разбиения, usamo 2009 p3(b) usamo usamo 2009 matching planar_graphs extremal_choice goal_proof sam vandervelde usamo-2009-p3-tasteful-domino-tiling-uniqueness edinstvennost izyaschnogo domino-razbieniya, usamo 2009 p3(b) usamo usamo 2009 matching planar_graphs extremal_choice goal_proof sam vandervelde"}
{"id":"usamo-2021-p2-planar-national-park-turning-walk","title":"Прогулка по 3-регулярному планарному графу, USAMO 2021 P2","path":"data\\problems\\usamo\\usamo-2021-p2-planar-national-park-turning-walk.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2021-p2-planar-national-park-turning-walk.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2021-p2-planar-national-park-turning-walk","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2021","tags":["planar_graphs","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2021-p2-planar-national-park-turning-walk прогулка по 3-регулярному планарному графу, usamo 2021 p2 usamo usamo 2021 planar_graphs extremal_choice goal_exact_bound usamo-2021-p2-planar-national-park-turning-walk progulka po 3-regulyarnomu planarnomu grafu, usamo 2021 p2 usamo usamo 2021 planar_graphs extremal_choice goal_exact_bound"}
{"id":"usamo-2022-p1-amber-bronze-transversal","title":"Янтарные и бронзовые клетки без общих строк и столбцов, USAMO 2022 P1","path":"data\\problems\\usamo\\usamo-2022-p1-amber-bronze-transversal.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2022-p1-amber-bronze-transversal.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2022-p1-amber-bronze-transversal","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2022","tags":["matching","extremal_choice","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"mixed_self_contained_and_external_tool","search_text":"usamo-2022-p1-amber-bronze-transversal янтарные и бронзовые клетки без общих строк и столбцов, usamo 2022 p1 usamo usamo 2022 matching extremal_choice goal_proof ankan bhattacharya usamo-2022-p1-amber-bronze-transversal yantarnye i bronzovye kletki bez obschih strok i stolbtsov, usamo 2022 p1 usamo usamo 2022 matching extremal_choice goal_proof ankan bhattacharya"}
{"id":"usamo-2022-p6-mathbook-two-common-friends-closure","title":"Mathbook и замыкание по двум общим друзьям, USAMO 2022 P6","path":"data\\problems\\usamo\\usamo-2022-p6-mathbook-two-common-friends-closure.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2022-p6-mathbook-two-common-friends-closure.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2022-p6-mathbook-two-common-friends-closure","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2022","tags":["double_counting","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2022-p6-mathbook-two-common-friends-closure mathbook и замыкание по двум общим друзьям, usamo 2022 p6 usamo usamo 2022 double_counting extremal_choice goal_exact_bound yannick yao usamo-2022-p6-mathbook-two-common-friends-closure mathbook i zamykanie po dvum obschim druzyam, usamo 2022 p6 usamo usamo 2022 double_counting extremal_choice goal_exact_bound yannick yao"}
{"id":"usamo-2023-p3-domino-slides-special-square-digraph","title":"Слайды домино, USAMO 2023 P3","path":"data\\problems\\usamo\\usamo-2023-p3-domino-slides-special-square-digraph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2023-p3-domino-slides-special-square-digraph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2023-p3-domino-slides-special-square-digraph","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2023","tags":["trees","coloring","graph_in_solution","invariant","construction","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2023-p3-domino-slides-special-square-digraph слайды домино, usamo 2023 p3 usamo usamo 2023 trees coloring graph_in_solution invariant construction goal_characterization holden mui usamo-2023-p3-domino-slides-special-square-digraph slaydy domino, usamo 2023 p3 usamo usamo 2023 trees coloring graph_in_solution invariant construction goal_characterization holden mui"}
{"id":"usamo-2024-p3-balanced-regular-polygon-triangulation","title":"m-сбалансированная триангуляция правильного многоугольника, USAMO 2024 P3","path":"data\\problems\\usamo\\usamo-2024-p3-balanced-regular-polygon-triangulation.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2024-p3-balanced-regular-polygon-triangulation.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2024-p3-balanced-regular-polygon-triangulation","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2024","tags":["planar_graphs","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2024-p3-balanced-regular-polygon-triangulation m-сбалансированная триангуляция правильного многоугольника, usamo 2024 p3 usamo usamo 2024 planar_graphs goal_characterization krit boonsiriseth usamo-2024-p3-balanced-regular-polygon-triangulation m-sbalansirovannaya triangulyatsiya pravilnogo mnogougolnika, usamo 2024 p3 usamo usamo 2024 planar_graphs goal_characterization krit boonsiriseth"}
{"id":"usamo-2025-p3-gabriel-graph-road-network","title":"Дорожная сеть как граф Габриэля, USAMO 2025 P3","path":"data\\problems\\usamo\\usamo-2025-p3-gabriel-graph-road-network.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/usamo/usamo-2025-p3-gabriel-graph-road-network.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#usamo-2025-p3-gabriel-graph-road-network","source_key":"usamo","source_keys":["usamo"],"source_label":"USAMO","year":"2025","tags":["planar_graphs","goal_characterization"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"usamo-2025-p3-gabriel-graph-road-network дорожная сеть как граф габриэля, usamo 2025 p3 usamo usamo 2025 planar_graphs goal_characterization carl schildkraut usamo-2025-p3-gabriel-graph-road-network dorozhnaya set kak graf gabrielya, usamo 2025 p3 usamo usamo 2025 planar_graphs goal_characterization carl schildkraut"}
{"id":"utyum-1993_ii_7kl_1","title":"Квадрат перестановки и направленный цикл, УТЮМ 1993","path":"data\\problems\\utyum\\utyum-1993_ii_7kl_1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-1993_ii_7kl_1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-1993_ii_7kl_1","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"1993","tags":["goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-1993_ii_7kl_1 квадрат перестановки и направленный цикл, утюм 1993 misc утюм 1993 goal_impossibility utyum-1993_ii_7kl_1 kvadrat perestanovki i napravlennyy tsikl, utyum 1993 misc utyum 1993 goal_impossibility"}
{"id":"utyum-1993_ii_8kl_5","title":"Минимум рёбер при общем соседе у каждой несмежной пары, УТЮМ 1993","path":"data\\problems\\utyum\\utyum-1993_ii_8kl_5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-1993_ii_8kl_5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-1993_ii_8kl_5","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"1993","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-1993_ii_8kl_5 минимум рёбер при общем соседе у каждой несмежной пары, утюм 1993 misc утюм 1993 connectivity extremal_graph_theory goal_exact_bound utyum-1993_ii_8kl_5 minimum reber pri obschem sosede u kazhdoy nesmezhnoy pary, utyum 1993 misc utyum 1993 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"utyum-1995_final_10_writers_committee","title":"Ориентированный граф чтения 22 юных писателей, УТЮМ 1995","path":"data\\problems\\utyum\\utyum-1995_final_10_writers_committee.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-1995_final_10_writers_committee.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-1995_final_10_writers_committee","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"1995","tags":["extremal_choice","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-1995_final_10_writers_committee ориентированный граф чтения 22 юных писателей, утюм 1995 misc утюм 1995 extremal_choice extremal_graph_theory goal_exact_bound utyum-1995_final_10_writers_committee orientirovannyy graf chteniya 22 yunyh pisateley, utyum 1995 misc utyum 1995 extremal_choice extremal_graph_theory goal_exact_bound"}
{"id":"utyum-1995_mb2_8_secret_object","title":"Переключения рёбер на цикле C100, УТЮМ 1995","path":"data\\problems\\utyum\\utyum-1995_mb2_8_secret_object.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-1995_mb2_8_secret_object.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-1995_mb2_8_secret_object","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"1995","tags":["goal_construction","invariant"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-1995_mb2_8_secret_object переключения рёбер на цикле c100, утюм 1995 misc утюм 1995 goal_construction invariant utyum-1995_mb2_8_secret_object pereklyucheniya reber na tsikle c100, utyum 1995 misc utyum 1995 goal_construction invariant"}
{"id":"utyum-1996_tur3_10_central_cities","title":"Центральные вершины дерева, УТЮМ 1996","path":"data\\problems\\utyum\\utyum-1996_tur3_10_central_cities.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-1996_tur3_10_central_cities.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-1996_tur3_10_central_cities","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"1996","tags":["trees","connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-1996_tur3_10_central_cities центральные вершины дерева, утюм 1996 misc утюм 1996 trees connectivity goal_exact_bound utyum-1996_tur3_10_central_cities tsentralnye vershiny dereva, utyum 1996 misc utyum 1996 trees connectivity goal_exact_bound"}
{"id":"utyum-2001_olymp8_6_countries_route","title":"Маршрут по 19 странам и закрытые границы, УТЮМ 2001","path":"data\\problems\\utyum\\utyum-2001_olymp8_6_countries_route.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2001_olymp8_6_countries_route.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2001_olymp8_6_countries_route","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2001","tags":["planar_graphs","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2001_olymp8_6_countries_route маршрут по 19 странам и закрытые границы, утюм 2001 misc утюм 2001 planar_graphs goal_counting utyum-2001_olymp8_6_countries_route marshrut po 19 stranam i zakrytye granitsy, utyum 2001 misc utyum 2001 planar_graphs goal_counting"}
{"id":"utyum-2002_carousel_senior_8x8_polyline","title":"Максимальный простой цикл в сетке 8x8, УТЮМ 2002","path":"data\\problems\\utyum\\utyum-2002_carousel_senior_8x8_polyline.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2002_carousel_senior_8x8_polyline.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2002_carousel_senior_8x8_polyline","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2002","tags":["planar_graphs","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2002_carousel_senior_8x8_polyline максимальный простой цикл в сетке 8x8, утюм 2002 misc утюм 2002 planar_graphs goal_exact_bound utyum-2002_carousel_senior_8x8_polyline maksimalnyy prostoy tsikl v setke 8x8, utyum 2002 misc utyum 2002 planar_graphs goal_exact_bound"}
{"id":"utyum-2004_line_acquaintances_endpoints","title":"Равенство степеней крайних при балансе знакомств слева и справа, УТЮМ 2004","path":"data\\problems\\utyum\\utyum-2004_line_acquaintances_endpoints.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2004_line_acquaintances_endpoints.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2004_line_acquaintances_endpoints","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2004","tags":["double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2004_line_acquaintances_endpoints равенство степеней крайних при балансе знакомств слева и справа, утюм 2004 misc утюм 2004 double_counting goal_counting utyum-2004_line_acquaintances_endpoints ravenstvo stepeney kraynih pri balanse znakomstv sleva i sprava, utyum 2004 misc utyum 2004 double_counting goal_counting"}
{"id":"utyum-2006_ural27_8_acquaintance_pairs","title":"Треугольники знакомств в каждой пятёрке, УТЮМ 2006","path":"data\\problems\\utyum\\utyum-2006_ural27_8_acquaintance_pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2006_ural27_8_acquaintance_pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2006_ural27_8_acquaintance_pairs","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2006","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2006_ural27_8_acquaintance_pairs треугольники знакомств в каждой пятёрке, утюм 2006 misc утюм 2006 extremal_graph_theory goal_exact_bound utyum-2006_ural27_8_acquaintance_pairs treugolniki znakomstv v kazhdoy pyaterke, utyum 2006 misc utyum 2006 extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2007_lichol30_4_rectangle_coloring","title":"Двухцветная раскраска клеточного графа, УТЮМ 2007","path":"data\\problems\\utyum\\utyum-2007_lichol30_4_rectangle_coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2007_lichol30_4_rectangle_coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2007_lichol30_4_rectangle_coloring","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2007","tags":["coloring","double_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2007_lichol30_4_rectangle_coloring двухцветная раскраска клеточного графа, утюм 2007 misc утюм 2007 coloring double_counting goal_exact_bound utyum-2007_lichol30_4_rectangle_coloring dvuhtsvetnaya raskraska kletochnogo grafa, utyum 2007 misc utyum 2007 coloring double_counting goal_exact_bound"}
{"id":"utyum-2008_tur4_31_6_directed_cities","title":"Попарная достижимость в ориентированном графе, УТЮМ 2008","path":"data\\problems\\utyum\\utyum-2008_tur4_31_6_directed_cities.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2008_tur4_31_6_directed_cities.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2008_tur4_31_6_directed_cities","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2008","tags":["connectivity","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2008_tur4_31_6_directed_cities попарная достижимость в ориентированном графе, утюм 2008 misc утюм 2008 connectivity goal_construction utyum-2008_tur4_31_6_directed_cities poparnaya dostizhimost v orientirovannom grafe, utyum 2008 misc utyum 2008 connectivity goal_construction"}
{"id":"utyum-2010_tur4_36_4_islands_bridges","title":"Эйлеровы маршруты на цикле с удвоенными рёбрами, УТЮМ 2010","path":"data\\problems\\utyum\\utyum-2010_tur4_36_4_islands_bridges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2010_tur4_36_4_islands_bridges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2010_tur4_36_4_islands_bridges","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2010","tags":["eulerian_graphs","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2010_tur4_36_4_islands_bridges эйлеровы маршруты на цикле с удвоенными рёбрами, утюм 2010 misc утюм 2010 eulerian_graphs goal_counting utyum-2010_tur4_36_4_islands_bridges eylerovy marshruty na tsikle s udvoennymi rebrami, utyum 2010 misc utyum 2010 eulerian_graphs goal_counting"}
{"id":"utyum-2011_tur4_37_8_equal_sums_bipartite_graph","title":"Разрушение равных сумм строк и столбцов в таблице 50x50, УТЮМ 2011","path":"data\\problems\\utyum\\utyum-2011_tur4_37_8_equal_sums_bipartite_graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2011_tur4_37_8_equal_sums_bipartite_graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2011_tur4_37_8_equal_sums_bipartite_graph","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2011","tags":["double_counting","matching","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2011_tur4_37_8_equal_sums_bipartite_graph разрушение равных сумм строк и столбцов в таблице 50x50, утюм 2011 misc утюм 2011 double_counting matching goal_exact_bound utyum-2011_tur4_37_8_equal_sums_bipartite_graph razrushenie ravnyh summ strok i stolbtsov v tablitse 50x50, utyum 2011 misc utyum 2011 double_counting matching goal_exact_bound"}
{"id":"utyum-2012_komol39_5_republic_in_complete_graph","title":"Размер республики с равными внутренними и внешними рёбрами в K100, УТЮМ 2012","path":"data\\problems\\utyum\\utyum-2012_komol39_5_republic_in_complete_graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2012_komol39_5_republic_in_complete_graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2012_komol39_5_republic_in_complete_graph","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2012","tags":["goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2012_komol39_5_republic_in_complete_graph размер республики с равными внутренними и внешними рёбрами в k100, утюм 2012 misc утюм 2012 goal_classification utyum-2012_komol39_5_republic_in_complete_graph razmer respubliki s ravnymi vnutrennimi i vneshnimi rebrami v k100, utyum 2012 misc utyum 2012 goal_classification"}
{"id":"utyum-2012_komol39_8_binary_tree_ordering","title":"Линейная укладка графа степени не выше 3 с короткими рёбрами, УТЮМ 2012","path":"data\\problems\\utyum\\utyum-2012_komol39_8_binary_tree_ordering.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2012_komol39_8_binary_tree_ordering.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2012_komol39_8_binary_tree_ordering","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2012","tags":["trees","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2012_komol39_8_binary_tree_ordering линейная укладка графа степени не выше 3 с короткими рёбрами, утюм 2012 misc утюм 2012 trees goal_counting utyum-2012_komol39_8_binary_tree_ordering lineynaya ukladka grafa stepeni ne vyshe 3 s korotkimi rebrami, utyum 2012 misc utyum 2012 trees goal_counting"}
{"id":"utyum-2016_tur1_start2_1_octahedron_acquaintances","title":"Минимальный 4-регулярный граф с двумя общими соседями у смежных пар, УТЮМ 2016","path":"data\\problems\\utyum\\utyum-2016_tur1_start2_1_octahedron_acquaintances.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2016_tur1_start2_1_octahedron_acquaintances.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2016_tur1_start2_1_octahedron_acquaintances","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2016","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2016_tur1_start2_1_octahedron_acquaintances минимальный 4-регулярный граф с двумя общими соседями у смежных пар, утюм 2016 misc утюм 2016 extremal_graph_theory goal_exact_bound utyum-2016_tur1_start2_1_octahedron_acquaintances minimalnyy 4-regulyarnyy graf s dvumya obschimi sosedyami u smezhnyh par, utyum 2016 misc utyum 2016 extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2016_tur2_3_min_acquaintance_pairs","title":"Минимум рёбер при двух непересекающихся знакомствах в любой четвёрке, УТЮМ 2016","path":"data\\problems\\utyum\\utyum-2016_tur2_3_min_acquaintance_pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2016_tur2_3_min_acquaintance_pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2016_tur2_3_min_acquaintance_pairs","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2016","tags":["extremal_graph_theory","matching","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2016_tur2_3_min_acquaintance_pairs минимум рёбер при двух непересекающихся знакомствах в любой четвёрке, утюм 2016 misc утюм 2016 extremal_graph_theory matching goal_exact_bound utyum-2016_tur2_3_min_acquaintance_pairs minimum reber pri dvuh neperesekayuschihsya znakomstvah v lyuboy chetverke, utyum 2016 misc utyum 2016 extremal_graph_theory matching goal_exact_bound"}
{"id":"utyum-2018_komol_7_acquaintance_scores","title":"Двудольные знакомства и сравнение средних оценок, УТЮМ 2018","path":"data\\problems\\utyum\\utyum-2018_komol_7_acquaintance_scores.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2018_komol_7_acquaintance_scores.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2018_komol_7_acquaintance_scores","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2018","tags":["double_counting","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2018_komol_7_acquaintance_scores двудольные знакомства и сравнение средних оценок, утюм 2018 misc утюм 2018 double_counting goal_construction utyum-2018_komol_7_acquaintance_scores dvudolnye znakomstva i sravnenie srednih otsenok, utyum 2018 misc utyum 2018 double_counting goal_construction"}
{"id":"utyum-2018_komol_7_red_blue_cycle_game","title":"Игра на двудольных рёбрах до первого 4-цикла, УТЮМ 2018","path":"data\\problems\\utyum\\utyum-2018_komol_7_red_blue_cycle_game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2018_komol_7_red_blue_cycle_game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2018_komol_7_red_blue_cycle_game","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2018","tags":["coloring","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2018_komol_7_red_blue_cycle_game игра на двудольных рёбрах до первого 4-цикла, утюм 2018 misc утюм 2018 coloring goal_strategy_game utyum-2018_komol_7_red_blue_cycle_game igra na dvudolnyh rebrah do pervogo 4-tsikla, utyum 2018 misc utyum 2018 coloring goal_strategy_game"}
{"id":"utyum-2018_lichol_6_strategic_cities","title":"Тотальное доминирование в связном графе, УТЮМ 2018","path":"data\\problems\\utyum\\utyum-2018_lichol_6_strategic_cities.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2018_lichol_6_strategic_cities.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2018_lichol_6_strategic_cities","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2018","tags":["trees","connectivity","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2018_lichol_6_strategic_cities тотальное доминирование в связном графе, утюм 2018 misc утюм 2018 trees connectivity goal_strategy_game utyum-2018_lichol_6_strategic_cities totalnoe dominirovanie v svyaznom grafe, utyum 2018 misc utyum 2018 trees connectivity goal_strategy_game"}
{"id":"utyum-2018_lichol_8_tree_cities","title":"1000 доминирующих вершин в дереве на 1500 вершинах, УТЮМ 2018","path":"data\\problems\\utyum\\utyum-2018_lichol_8_tree_cities.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2018_lichol_8_tree_cities.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2018_lichol_8_tree_cities","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2018","tags":["trees","connectivity","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2018_lichol_8_tree_cities 1000 доминирующих вершин в дереве на 1500 вершинах, утюм 2018 misc утюм 2018 trees connectivity goal_existence utyum-2018_lichol_8_tree_cities 1000 dominiruyuschih vershin v dereve na 1500 vershinah, utyum 2018 misc utyum 2018 trees connectivity goal_existence"}
{"id":"utyum-2019_komol_7_airline_costs","title":"Сумма весов 10, 20, 30 в полном графе на 20 городах, УТЮМ 2019","path":"data\\problems\\utyum\\utyum-2019_komol_7_airline_costs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2019_komol_7_airline_costs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2019_komol_7_airline_costs","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2019","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2019_komol_7_airline_costs сумма весов 10, 20, 30 в полном графе на 20 городах, утюм 2019 misc утюм 2019 extremal_graph_theory goal_exact_bound utyum-2019_komol_7_airline_costs summa vesov 10, 20, 30 v polnom grafe na 20 gorodah, utyum 2019 misc utyum 2019 extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2021_komol_6_archipelago_bridges","title":"Локальное условие на пути длины 3, УТЮМ 2021","path":"data\\problems\\utyum\\utyum-2021_komol_6_archipelago_bridges.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2021_komol_6_archipelago_bridges.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2021_komol_6_archipelago_bridges","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2021","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2021_komol_6_archipelago_bridges локальное условие на пути длины 3, утюм 2021 misc утюм 2021 connectivity goal_exact_bound utyum-2021_komol_6_archipelago_bridges lokalnoe uslovie na puti dliny 3, utyum 2021 misc utyum 2021 connectivity goal_exact_bound"}
{"id":"utyum-2021_komol_7_no_k5_many_acquaintances","title":"Минимальный K5-свободный граф с минимальной степенью 2021, УТЮМ 2021","path":"data\\problems\\utyum\\utyum-2021_komol_7_no_k5_many_acquaintances.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2021_komol_7_no_k5_many_acquaintances.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2021_komol_7_no_k5_many_acquaintances","source_key":"k5","source_keys":["k5"],"source_label":"Минимальный K5-свободный граф с минимальной степенью","year":"2021","tags":["extremal_graph_theory","forbidden_clique","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2021_komol_7_no_k5_many_acquaintances минимальный k5-свободный граф с минимальной степенью 2021, утюм 2021 k5 минимальный k5-свободный граф с минимальной степенью 2021 extremal_graph_theory forbidden_clique goal_exact_bound utyum-2021_komol_7_no_k5_many_acquaintances minimalnyy k5-svobodnyy graf s minimalnoy stepenyu 2021, utyum 2021 k5 minimalnyy k5-svobodnyy graf s minimalnoy stepenyu 2021 extremal_graph_theory forbidden_clique goal_exact_bound"}
{"id":"utyum-2023_komol60_6_7_company_departures","title":"Удаление единственного максимума степени в графе на 100 вершинах, УТЮМ 2023","path":"data\\problems\\utyum\\utyum-2023_komol60_6_7_company_departures.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2023_komol60_6_7_company_departures.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2023_komol60_6_7_company_departures","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2023","tags":["extremal_choice","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2023_komol60_6_7_company_departures удаление единственного максимума степени в графе на 100 вершинах, утюм 2023 misc утюм 2023 extremal_choice extremal_graph_theory goal_exact_bound utyum-2023_komol60_6_7_company_departures udalenie edinstvennogo maksimuma stepeni v grafe na 100 vershinah, utyum 2023 misc utyum 2023 extremal_choice extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2023_komol60_7_7_room_departures","title":"Удаление вершины со степенью выше остальных на 2 в графе из 99 человек, УТЮМ 2023","path":"data\\problems\\utyum\\utyum-2023_komol60_7_7_room_departures.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2023_komol60_7_7_room_departures.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2023_komol60_7_7_room_departures","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2023","tags":["extremal_choice","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2023_komol60_7_7_room_departures удаление вершины со степенью выше остальных на 2 в графе из 99 человек, утюм 2023 misc утюм 2023 extremal_choice extremal_graph_theory goal_exact_bound utyum-2023_komol60_7_7_room_departures udalenie vershiny so stepenyu vyshe ostalnyh na 2 v grafe iz 99 chelovek, utyum 2023 misc utyum 2023 extremal_choice extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2023_komol61_6_2_common_acquaintances","title":"Общие соседи пятёрок из условия на любые десять вершин, УТЮМ 2023","path":"data\\problems\\utyum\\utyum-2023_komol61_6_2_common_acquaintances.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2023_komol61_6_2_common_acquaintances.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2023_komol61_6_2_common_acquaintances","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2023","tags":["extremal_choice","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2023_komol61_6_2_common_acquaintances общие соседи пятёрок из условия на любые десять вершин, утюм 2023 misc утюм 2023 extremal_choice extremal_graph_theory goal_exact_bound utyum-2023_komol61_6_2_common_acquaintances obschie sosedi pyaterok iz usloviya na lyubye desyat vershin, utyum 2023 misc utyum 2023 extremal_choice extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2023_komol61_8_5_yozhgorod_registry","title":"Линейные расширения звезды из площадей и улиц, УТЮМ 2023","path":"data\\problems\\utyum\\utyum-2023_komol61_8_5_yozhgorod_registry.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2023_komol61_8_5_yozhgorod_registry.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2023_komol61_8_5_yozhgorod_registry","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2023","tags":["trees","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2023_komol61_8_5_yozhgorod_registry линейные расширения звезды из площадей и улиц, утюм 2023 misc утюм 2023 trees goal_construction utyum-2023_komol61_8_5_yozhgorod_registry lineynye rasshireniya zvezdy iz ploschadey i ulits, utyum 2023 misc utyum 2023 trees goal_construction"}
{"id":"utyum-2024_komol62_6_3_circle_graph_coloring","title":"5-раскраска графа на 11 точках без клики размера 6, УТЮМ 2024","path":"data\\problems\\utyum\\utyum-2024_komol62_6_3_circle_graph_coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2024_komol62_6_3_circle_graph_coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2024_komol62_6_3_circle_graph_coloring","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2024","tags":["coloring","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2024_komol62_6_3_circle_graph_coloring 5-раскраска графа на 11 точках без клики размера 6, утюм 2024 misc утюм 2024 coloring goal_counting utyum-2024_komol62_6_3_circle_graph_coloring 5-raskraska grafa na 11 tochkah bez kliki razmera 6, utyum 2024 misc utyum 2024 coloring goal_counting"}
{"id":"utyum-2024_komol62_8_5_average_degree_friends","title":"Степени соседей в графе без изолированных вершин, УТЮМ 2024","path":"data\\problems\\utyum\\utyum-2024_komol62_8_5_average_degree_friends.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2024_komol62_8_5_average_degree_friends.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2024_komol62_8_5_average_degree_friends","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2024","tags":["double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2024_komol62_8_5_average_degree_friends степени соседей в графе без изолированных вершин, утюм 2024 misc утюм 2024 double_counting goal_counting utyum-2024_komol62_8_5_average_degree_friends stepeni sosedey v grafe bez izolirovannyh vershin, utyum 2024 misc utyum 2024 double_counting goal_counting"}
{"id":"utyum-2024_komol63_67_capital_flights_bipartite","title":"Подграфы с теми же расстояниями от корня, УТЮМ 2024","path":"data\\problems\\utyum\\utyum-2024_komol63_67_capital_flights_bipartite.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2024_komol63_67_capital_flights_bipartite.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2024_komol63_67_capital_flights_bipartite","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2024","tags":["coloring","connectivity","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2024_komol63_67_capital_flights_bipartite подграфы с теми же расстояниями от корня, утюм 2024 misc утюм 2024 coloring connectivity goal_counting utyum-2024_komol63_67_capital_flights_bipartite podgrafy s temi zhe rasstoyaniyami ot kornya, utyum 2024 misc utyum 2024 coloring connectivity goal_counting"}
{"id":"utyum-2024_komol63_8_4_lipshire_roads","title":"Максимум рёбер без смежных универсальных вершин на n вершинах, УТЮМ 2024","path":"data\\problems\\utyum\\utyum-2024_komol63_8_4_lipshire_roads.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2024_komol63_8_4_lipshire_roads.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2024_komol63_8_4_lipshire_roads","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2024","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2024_komol63_8_4_lipshire_roads максимум рёбер без смежных универсальных вершин на n вершинах, утюм 2024 misc утюм 2024 extremal_graph_theory goal_exact_bound utyum-2024_komol63_8_4_lipshire_roads maksimum reber bez smezhnyh universalnyh vershin na n vershinah, utyum 2024 misc utyum 2024 extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2025_komol64_6_6_odd_degree_game","title":"Остовный подграф с нечётными степенями, УТЮМ 2025","path":"data\\problems\\utyum\\utyum-2025_komol64_6_6_odd_degree_game.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2025_komol64_6_6_odd_degree_game.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2025_komol64_6_6_odd_degree_game","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2025","tags":["goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2025_komol64_6_6_odd_degree_game остовный подграф с нечётными степенями, утюм 2025 misc утюм 2025 goal_strategy_game utyum-2025_komol64_6_6_odd_degree_game ostovnyy podgraf s nechetnymi stepenyami, utyum 2025 misc utyum 2025 goal_strategy_game"}
{"id":"utyum-2025_komol64_7_5_important_cities_tree","title":"Минимум рёбер, сохраняющих связность и доминирование важными вершинами, УТЮМ 2025","path":"data\\problems\\utyum\\utyum-2025_komol64_7_5_important_cities_tree.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2025_komol64_7_5_important_cities_tree.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2025_komol64_7_5_important_cities_tree","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2025","tags":["trees","connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2025_komol64_7_5_important_cities_tree минимум рёбер, сохраняющих связность и доминирование важными вершинами, утюм 2025 misc утюм 2025 trees connectivity goal_exact_bound utyum-2025_komol64_7_5_important_cities_tree minimum reber, sohranyayuschih svyaznost i dominirovanie vazhnymi vershinami, utyum 2025 misc utyum 2025 trees connectivity goal_exact_bound"}
{"id":"utyum-2025_komol64_8_7_tree_matchings_path","title":"820 толстых паросочетаний заставляют дерево на 80 вершинах быть путём, УТЮМ 2025","path":"data\\problems\\utyum\\utyum-2025_komol64_8_7_tree_matchings_path.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2025_komol64_8_7_tree_matchings_path.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2025_komol64_8_7_tree_matchings_path","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2025","tags":["trees","matching","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2025_komol64_8_7_tree_matchings_path 820 толстых паросочетаний заставляют дерево на 80 вершинах быть путём, утюм 2025 misc утюм 2025 trees matching goal_exact_bound utyum-2025_komol64_8_7_tree_matchings_path 820 tolstyh parosochetaniy zastavlyayut derevo na 80 vershinah byt putem, utyum 2025 misc utyum 2025 trees matching goal_exact_bound"}
{"id":"utyum-2025_komol65_7_6_airlines_degree_sum","title":"Постоянная сумма степеней несмежных пар в графе на нечётном числе вершин, УТЮМ 2025","path":"data\\problems\\utyum\\utyum-2025_komol65_7_6_airlines_degree_sum.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2025_komol65_7_6_airlines_degree_sum.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2025_komol65_7_6_airlines_degree_sum","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2025","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2025_komol65_7_6_airlines_degree_sum постоянная сумма степеней несмежных пар в графе на нечётном числе вершин, утюм 2025 misc утюм 2025 extremal_graph_theory goal_exact_bound utyum-2025_komol65_7_6_airlines_degree_sum postoyannaya summa stepeney nesmezhnyh par v grafe na nechetnom chisle vershin, utyum 2025 misc utyum 2025 extremal_graph_theory goal_exact_bound"}
{"id":"utyum-2025_komol65_8_6_oriented_graph_bound","title":"Нижняя граница для орграфа с доминирующей вершиной вне каждого k-множества, УТЮМ 2025","path":"data\\problems\\utyum\\utyum-2025_komol65_8_6_oriented_graph_bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/utyum/utyum-2025_komol65_8_6_oriented_graph_bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#utyum-2025_komol65_8_6_oriented_graph_bound","source_key":"misc","source_keys":["misc"],"source_label":"УТЮМ","year":"2025","tags":["extremal_graph_theory","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"utyum-2025_komol65_8_6_oriented_graph_bound нижняя граница для орграфа с доминирующей вершиной вне каждого k-множества, утюм 2025 misc утюм 2025 extremal_graph_theory induction goal_exact_bound utyum-2025_komol65_8_6_oriented_graph_bound nizhnyaya granitsa dlya orgrafa s dominiruyuschey vershinoy vne kazhdogo k-mnozhestva, utyum 2025 misc utyum 2025 extremal_graph_theory induction goal_exact_bound"}
{"id":"vertex-coloring-to-bipartite-edge-layers","title":"Коды вершинных цветов разбивают рёбра на двудольные слои","path":"data\\problems\\classical\\vertex-coloring-to-bipartite-edge-layers.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/classical/vertex-coloring-to-bipartite-edge-layers.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vertex-coloring-to-bipartite-edge-layers","source_key":"misc","source_keys":["misc","kolmogorov"],"source_label":"Прочее","year":"","tags":["coloring","goal_construction","goal_bound","classical_theorem"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vertex-coloring-to-bipartite-edge-layers коды вершинных цветов разбивают рёбра на двудольные слои misc прочее coloring goal_construction goal_bound classical_theorem vertex-coloring-to-bipartite-edge-layers kody vershinnyh tsvetov razbivayut rebra na dvudolnye sloi misc prochee coloring goal_construction goal_bound classical_theorem"}
{"id":"vjimc-1999-cat2-p1-lines-ramsey-three-relations","title":"Девять прямых в пространстве и однотипная тройка, VJIMC 1999 Category II P1","path":"data\\problems\\vjimc\\vjimc-1999-cat2-p1-lines-ramsey-three-relations.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-1999-cat2-p1-lines-ramsey-three-relations.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-1999-cat2-p1-lines-ramsey-three-relations","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"1999","tags":["ramsey_theory","coloring","construction","line_arrangements","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-1999-cat2-p1-lines-ramsey-three-relations девять прямых в пространстве и однотипная тройка, vjimc 1999 category ii p1 vjimc vjimc 1999 ramsey_theory coloring construction line_arrangements goal_exact_bound vjimc-1999-cat2-p1-lines-ramsey-three-relations devyat pryamyh v prostranstve i odnotipnaya troyka, vjimc 1999 category ii p1 vjimc vjimc 1999 ramsey_theory coloring construction line_arrangements goal_exact_bound"}
{"id":"vjimc-2000-cat1-p4-red-blue-distances","title":"Красно-синие расстояния в правильном \\(2n\\)-угольнике, VJIMC 2000 Category I P4","path":"data\\problems\\vjimc\\vjimc-2000-cat1-p4-red-blue-distances.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2000-cat1-p4-red-blue-distances.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2000-cat1-p4-red-blue-distances","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2000","tags":["graph_symmetry","double_counting","coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2000-cat1-p4-red-blue-distances красно-синие расстояния в правильном \\(2n\\)-угольнике, vjimc 2000 category i p4 vjimc vjimc 2000 graph_symmetry double_counting coloring goal_proof vjimc-2000-cat1-p4-red-blue-distances krasno-sinie rasstoyaniya v pravilnom \\(2n\\)-ugolnike, vjimc 2000 category i p4 vjimc vjimc 2000 graph_symmetry double_counting coloring goal_proof"}
{"id":"vjimc-2000-cat2-p2-de-bruijn-euler-cycle","title":"Циклическая последовательность со всеми словами длины \\(l\\), VJIMC 2000 Category II P2","path":"data\\problems\\vjimc\\vjimc-2000-cat2-p2-de-bruijn-euler-cycle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2000-cat2-p2-de-bruijn-euler-cycle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2000-cat2-p2-de-bruijn-euler-cycle","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2000","tags":["eulerian_graphs","connectivity","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2000-cat2-p2-de-bruijn-euler-cycle циклическая последовательность со всеми словами длины \\(l\\), vjimc 2000 category ii p2 vjimc vjimc 2000 eulerian_graphs connectivity goal_construction vjimc-2000-cat2-p2-de-bruijn-euler-cycle tsiklicheskaya posledovatelnost so vsemi slovami dliny \\(l\\), vjimc 2000 category ii p2 vjimc vjimc 2000 eulerian_graphs connectivity goal_construction"}
{"id":"vjimc-2005-cat2-p2-weighted-cut-half","title":"Разрез веса не меньше половины полной суммы, VJIMC 2005 Category II P2","path":"data\\problems\\vjimc\\vjimc-2005-cat2-p2-weighted-cut-half.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2005-cat2-p2-weighted-cut-half.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2005-cat2-p2-weighted-cut-half","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2005","tags":["extremal_choice","graph_cut","goal_existence","graph_model"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2005-cat2-p2-weighted-cut-half разрез веса не меньше половины полной суммы, vjimc 2005 category ii p2 vjimc vjimc 2005 extremal_choice graph_cut goal_existence graph_model vjimc-2005-cat2-p2-weighted-cut-half razrez vesa ne menshe poloviny polnoy summy, vjimc 2005 category ii p2 vjimc vjimc 2005 extremal_choice graph_cut goal_existence graph_model"}
{"id":"vjimc-2007-cat1-p2-key-ring-distinguishing-coloring","title":"Раскраска кольца ключей, различающая повороты и отражения, VJIMC 2007 Category I P2","path":"data\\problems\\vjimc\\vjimc-2007-cat1-p2-key-ring-distinguishing-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2007-cat1-p2-key-ring-distinguishing-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2007-cat1-p2-key-ring-distinguishing-coloring","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2007","tags":["coloring","graph_symmetry","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2007-cat1-p2-key-ring-distinguishing-coloring раскраска кольца ключей, различающая повороты и отражения, vjimc 2007 category i p2 vjimc vjimc 2007 coloring graph_symmetry construction goal_exact_bound vjimc-2007-cat1-p2-key-ring-distinguishing-coloring raskraska koltsa klyuchey, razlichayuschaya povoroty i otrazheniya, vjimc 2007 category i p2 vjimc vjimc 2007 coloring graph_symmetry construction goal_exact_bound"}
{"id":"vjimc-2009-cat1-p3-partial-hypergraph-bicoloring","title":"Частичная двуцветная раскраска семейства гиперрёбер, VJIMC 2009 Category I P3","path":"data\\problems\\vjimc\\vjimc-2009-cat1-p3-partial-hypergraph-bicoloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2009-cat1-p3-partial-hypergraph-bicoloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2009-cat1-p3-partial-hypergraph-bicoloring","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2009","tags":["coloring","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2009-cat1-p3-partial-hypergraph-bicoloring частичная двуцветная раскраска семейства гиперрёбер, vjimc 2009 category i p3 vjimc vjimc 2009 coloring graph_model goal_existence vjimc-2009-cat1-p3-partial-hypergraph-bicoloring chastichnaya dvutsvetnaya raskraska semeystva giperreber, vjimc 2009 category i p3 vjimc vjimc 2009 coloring graph_model goal_existence"}
{"id":"vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound","title":"Оценка числа рёбер гиперграфа через разделяющие разбиения, VJIMC 2009 Category II P4","path":"data\\problems\\vjimc\\vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2009","tags":["extremal_graph_theory","graph_model","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound оценка числа рёбер гиперграфа через разделяющие разбиения, vjimc 2009 category ii p4 vjimc vjimc 2009 extremal_graph_theory graph_model goal_bound vjimc-2009-cat2-p4-transversal-hypergraph-polynomial-bound otsenka chisla reber gipergrafa cherez razdelyayuschie razbieniya, vjimc 2009 category ii p4 vjimc vjimc 2009 extremal_graph_theory graph_model goal_bound"}
{"id":"vjimc-2013-cat2-p2-hypercube-segment-intersections","title":"Точки пересечения хорд между вершинами гиперкуба, VJIMC 2013 Category II P2","path":"data\\problems\\vjimc\\vjimc-2013-cat2-p2-hypercube-segment-intersections.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2013-cat2-p2-hypercube-segment-intersections.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2013-cat2-p2-hypercube-segment-intersections","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2013","tags":["graph_model","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2013-cat2-p2-hypercube-segment-intersections точки пересечения хорд между вершинами гиперкуба, vjimc 2013 category ii p2 vjimc vjimc 2013 graph_model goal_counting vjimc-2013-cat2-p2-hypercube-segment-intersections tochki peresecheniya hord mezhdu vershinami giperkuba, vjimc 2013 category ii p2 vjimc vjimc 2013 graph_model goal_counting"}
{"id":"vjimc-2017-cat1-p3-polyhedron-edge-products","title":"Веса на вершинах многогранника и сумма произведений по рёбрам, VJIMC 2017 I.3","path":"data\\problems\\vjimc\\vjimc-2017-cat1-p3-polyhedron-edge-products.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2017-cat1-p3-polyhedron-edge-products.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2017-cat1-p3-polyhedron-edge-products","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2017","tags":["planar_graphs","extremal_graph_theory","extremal_choice","symmetrization","forbidden_clique","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2017-cat1-p3-polyhedron-edge-products веса на вершинах многогранника и сумма произведений по рёбрам, vjimc 2017 i.3 vjimc vjimc 2017 planar_graphs extremal_graph_theory extremal_choice symmetrization forbidden_clique goal_bound vjimc-2017-cat1-p3-polyhedron-edge-products vesa na vershinah mnogogrannika i summa proizvedeniy po rebram, vjimc 2017 i.3 vjimc vjimc 2017 planar_graphs extremal_graph_theory extremal_choice symmetrization forbidden_clique goal_bound"}
{"id":"vjimc-2022-cat1-p4-stone-game-state-graph","title":"Игра с цветными камнями и граф состояний, VJIMC 2022 I.4","path":"data\\problems\\vjimc\\vjimc-2022-cat1-p4-stone-game-state-graph.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2022-cat1-p4-stone-game-state-graph.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2022-cat1-p4-stone-game-state-graph","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2022","tags":["graph_in_solution","process_invariant","invariant","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2022-cat1-p4-stone-game-state-graph игра с цветными камнями и граф состояний, vjimc 2022 i.4 vjimc vjimc 2022 graph_in_solution process_invariant invariant goal_strategy_game leszek pieniążek vjimc-2022-cat1-p4-stone-game-state-graph igra s tsvetnymi kamnyami i graf sostoyaniy, vjimc 2022 i.4 vjimc vjimc 2022 graph_in_solution process_invariant invariant goal_strategy_game leszek pieniążek"}
{"id":"vjimc-2024-cat1-p3-degree-squares-triangle","title":"Сумма квадратов степеней, вынуждающая треугольник, VJIMC 2024 I.3","path":"data\\problems\\vjimc\\vjimc-2024-cat1-p3-degree-squares-triangle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vjimc/vjimc-2024-cat1-p3-degree-squares-triangle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vjimc-2024-cat1-p3-degree-squares-triangle","source_key":"vjimc","source_keys":["vjimc"],"source_label":"VJIMC","year":"2024","tags":["extremal_graph_theory","double_counting","degree_counting","forbidden_triangle","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vjimc-2024-cat1-p3-degree-squares-triangle сумма квадратов степеней, вынуждающая треугольник, vjimc 2024 i.3 vjimc vjimc 2024 extremal_graph_theory double_counting degree_counting forbidden_triangle goal_proof slobodan filipovski vjimc-2024-cat1-p3-degree-squares-triangle summa kvadratov stepeney, vynuzhdayuschaya treugolnik, vjimc 2024 i.3 vjimc vjimc 2024 extremal_graph_theory double_counting degree_counting forbidden_triangle goal_proof slobodan filipovski"}
{"id":"vosh-1991-zonal-one-way-streets-return","title":"Односторонние улицы и квартал с круговым движением, XVII Всероссийская олимпиада 1991","path":"data\\problems\\vosh\\vosh-1991-zonal-one-way-streets-return.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-1991-zonal-one-way-streets-return.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-1991-zonal-one-way-streets-return","source_key":"vosh","source_keys":["vosh"],"source_label":"XVII Всероссийская олимпиада","year":"1991","tags":["planar_graphs","graph_model","extremal_choice","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original_checked","search_text":"vosh-1991-zonal-one-way-streets-return односторонние улицы и квартал с круговым движением, xvii всероссийская олимпиада 1991 vosh xvii всероссийская олимпиада 1991 planar_graphs graph_model extremal_choice goal_existence агаханов н. х., купцов л. п., резниченко с. в. vosh-1991-zonal-one-way-streets-return odnostoronnie ulitsy i kvartal s krugovym dvizheniem, xvii vserossiyskaya olimpiada 1991 vosh xvii vserossiyskaya olimpiada 1991 planar_graphs graph_model extremal_choice goal_existence agahanov n. h., kuptsov l. p., reznichenko s. v."}
{"id":"vosh-1992-zonal-air-travel-one-city-redundant","title":"Отделившаяся часть городов при односторонних авиаперелётах, XVIII Всероссийская олимпиада 1992","path":"data\\problems\\vosh\\vosh-1992-zonal-air-travel-one-city-redundant.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-1992-zonal-air-travel-one-city-redundant.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-1992-zonal-air-travel-one-city-redundant","source_key":"vosh","source_keys":["vosh"],"source_label":"XVIII Всероссийская олимпиада","year":"1992","tags":["connectivity","graph_model","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"vosh-1992-zonal-air-travel-one-city-redundant отделившаяся часть городов при односторонних авиаперелётах, xviii всероссийская олимпиада 1992 vosh xviii всероссийская олимпиада 1992 connectivity graph_model goal_existence яковлев г. н., куперман а. б., ковалёва л. г., зурабов о. р., городецкий п. и., кабанова м. в., аматуни г. а. vosh-1992-zonal-air-travel-one-city-redundant otdelivshayasya chast gorodov pri odnostoronnih aviapereletah, xviii vserossiyskaya olimpiada 1992 vosh xviii vserossiyskaya olimpiada 1992 connectivity graph_model goal_existence yakovlev g. n., kuperman a. b., kovaleva l. g., zurabov o. r., gorodetskiy p. i., kabanova m. v., amatuni g. a."}
{"id":"vosh-1992-zonal-airlines-route-transfer","title":"Авиакомпании и передача рейсов, XVIII Всероссийская олимпиада 1992","path":"data\\problems\\vosh\\vosh-1992-zonal-airlines-route-transfer.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-1992-zonal-airlines-route-transfer.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-1992-zonal-airlines-route-transfer","source_key":"vosh","source_keys":["vosh"],"source_label":"XVIII Всероссийская олимпиада","year":"1992","tags":["coloring","graph_model","augmenting_path","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-1992-zonal-airlines-route-transfer авиакомпании и передача рейсов, xviii всероссийская олимпиада 1992 vosh xviii всероссийская олимпиада 1992 coloring graph_model augmenting_path goal_construction яковлев г. н. и др. vosh-1992-zonal-airlines-route-transfer aviakompanii i peredacha reysov, xviii vserossiyskaya olimpiada 1992 vosh xviii vserossiyskaya olimpiada 1992 coloring graph_model augmenting_path goal_construction yakovlev g. n. i dr."}
{"id":"vosh-2000-01-final-tree-leaves-bridge-proof","title":"Дерево с чётным числом листьев и добавление рёбер, Всероссийская олимпиада 2000/01","path":"data\\problems\\vosh\\vosh-2000-01-final-tree-leaves-bridge-proof.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2000-01-final-tree-leaves-bridge-proof.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2000-01-final-tree-leaves-bridge-proof","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2000","tags":["trees","connectivity","extremal_choice","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2000-01-final-tree-leaves-bridge-proof дерево с чётным числом листьев и добавление рёбер, всероссийская олимпиада 2000/01 vosh всероссийская олимпиада 2000 trees connectivity extremal_choice goal_construction карпов д.в. vosh-2000-01-final-tree-leaves-bridge-proof derevo s chetnym chislom listev i dobavlenie reber, vserossiyskaya olimpiada 2000/01 vosh vserossiyskaya olimpiada 2000 trees connectivity extremal_choice goal_construction karpov d.v."}
{"id":"vosh-2000-01-final-universal-acquaintance","title":"Человек, знакомый со всеми, Всероссийская олимпиада 2000/01","path":"data\\problems\\vosh\\vosh-2000-01-final-universal-acquaintance.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2000-01-final-universal-acquaintance.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2000-01-final-universal-acquaintance","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2000","tags":["extremal_graph_theory","ramsey_theory","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2000-01-final-universal-acquaintance человек, знакомый со всеми, всероссийская олимпиада 2000/01 vosh всероссийская олимпиада 2000 extremal_graph_theory ramsey_theory extremal_choice goal_exact_bound берлов с.л. vosh-2000-01-final-universal-acquaintance chelovek, znakomyy so vsemi, vserossiyskaya olimpiada 2000/01 vosh vserossiyskaya olimpiada 2000 extremal_graph_theory ramsey_theory extremal_choice goal_exact_bound berlov s.l."}
{"id":"vosh-2005-06-final-dominoes-three-color-neighbors","title":"Трехцветная раскраска доминошек с малым числом одноцветных соседей, Всероссийская олимпиада 2005/06","path":"data\\problems\\vosh\\vosh-2005-06-final-dominoes-three-color-neighbors.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2005-06-final-dominoes-three-color-neighbors.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2005-06-final-dominoes-three-color-neighbors","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2005","tags":["coloring","graph_model","construction","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2005-06-final-dominoes-three-color-neighbors трехцветная раскраска доминошек с малым числом одноцветных соседей, всероссийская олимпиада 2005/06 vosh всероссийская олимпиада 2005 coloring graph_model construction goal_construction пастор а. vosh-2005-06-final-dominoes-three-color-neighbors trehtsvetnaya raskraska dominoshek s malym chislom odnotsvetnyh sosedey, vserossiyskaya olimpiada 2005/06 vosh vserossiyskaya olimpiada 2005 coloring graph_model construction goal_construction pastor a."}
{"id":"vosh-2008-regional-bureaucrats-common-neighborhood","title":"Бюрократы и общие знакомые, Всероссийская олимпиада 2008","path":"data\\problems\\vosh\\vosh-2008-regional-bureaucrats-common-neighborhood.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2008-regional-bureaucrats-common-neighborhood.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2008-regional-bureaucrats-common-neighborhood","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2008","tags":["ramsey_theory","double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2008-regional-bureaucrats-common-neighborhood бюрократы и общие знакомые, всероссийская олимпиада 2008 vosh всероссийская олимпиада 2008 ramsey_theory double_counting goal_counting берлов с.л. мурашкин м.в. vosh-2008-regional-bureaucrats-common-neighborhood byurokraty i obschie znakomye, vserossiyskaya olimpiada 2008 vosh vserossiyskaya olimpiada 2008 ramsey_theory double_counting goal_counting berlov s.l. murashkin m.v."}
{"id":"vosh-2010-11-final-nonbreakable-company","title":"Неразбиваемая компания без четырёх попарно знакомых, Всероссийская олимпиада 2010/11","path":"data\\problems\\vosh\\vosh-2010-11-final-nonbreakable-company.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2010-11-final-nonbreakable-company.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2010-11-final-nonbreakable-company","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2010","tags":["coloring","minimal_counterexample","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2010-11-final-nonbreakable-company неразбиваемая компания без четырёх попарно знакомых, всероссийская олимпиада 2010/11 vosh всероссийская олимпиада 2010 coloring minimal_counterexample goal_exact_bound дольников в.л. vosh-2010-11-final-nonbreakable-company nerazbivaemaya kompaniya bez chetyreh poparno znakomyh, vserossiyskaya olimpiada 2010/11 vosh vserossiyskaya olimpiada 2010 coloring minimal_counterexample goal_exact_bound dolnikov v.l."}
{"id":"vosh-2010-11-regional-warehouses-cement-routing","title":"Перевозка цемента по связной сети складов, Всероссийская олимпиада 2010/11","path":"data\\problems\\vosh\\vosh-2010-11-regional-warehouses-cement-routing.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2010-11-regional-warehouses-cement-routing.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2010-11-regional-warehouses-cement-routing","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2010","tags":["connectivity","induction","graph_model","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2010-11-regional-warehouses-cement-routing перевозка цемента по связной сети складов, всероссийская олимпиада 2010/11 vosh всероссийская олимпиада 2010 connectivity induction graph_model goal_exact_bound карасёв р. vosh-2010-11-regional-warehouses-cement-routing perevozka tsementa po svyaznoy seti skladov, vserossiyskaya olimpiada 2010/11 vosh vserossiyskaya olimpiada 2010 connectivity induction graph_model goal_exact_bound karasev r."}
{"id":"vosh-2013-14-regional-even-rows-columns","title":"Добавить фишки до чётных строк и столбцов, Всероссийская олимпиада 2013/14","path":"data\\problems\\vosh\\vosh-2013-14-regional-even-rows-columns.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2013-14-regional-even-rows-columns.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2013-14-regional-even-rows-columns","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2013","tags":["double_counting","trees","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2013-14-regional-even-rows-columns добавить фишки до чётных строк и столбцов, всероссийская олимпиада 2013/14 vosh всероссийская олимпиада 2013 double_counting trees goal_exact_bound берлов с.л. vosh-2013-14-regional-even-rows-columns dobavit fishki do chetnyh strok i stolbtsov, vserossiyskaya olimpiada 2013/14 vosh vserossiyskaya olimpiada 2013 double_counting trees goal_exact_bound berlov s.l."}
{"id":"vosh-2014-15-regional-grid-rainbow-rectangle","title":"Четыре разных цвета в прямоугольнике доски, Всероссийская олимпиада 2014/15","path":"data\\problems\\vosh\\vosh-2014-15-regional-grid-rainbow-rectangle.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2014-15-regional-grid-rainbow-rectangle.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2014-15-regional-grid-rainbow-rectangle","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2014","tags":["coloring","extremal_graph_theory","extremal_choice","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2014-15-regional-grid-rainbow-rectangle четыре разных цвета в прямоугольнике доски, всероссийская олимпиада 2014/15 vosh всероссийская олимпиада 2014 coloring extremal_graph_theory extremal_choice goal_exact_bound д. храмцов vosh-2014-15-regional-grid-rainbow-rectangle chetyre raznyh tsveta v pryamougolnike doski, vserossiyskaya olimpiada 2014/15 vosh vserossiyskaya olimpiada 2014 coloring extremal_graph_theory extremal_choice goal_exact_bound d. hramtsov"}
{"id":"vosh-2017-18-regional-friendship-triangle-factor","title":"Минимум дружб при разбиении после удаления ребёнка на тройки, Всероссийская олимпиада 2017/18","path":"data\\problems\\vosh\\vosh-2017-18-regional-friendship-triangle-factor.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2017-18-regional-friendship-triangle-factor.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2017-18-regional-friendship-triangle-factor","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2017","tags":["graph_model","extremal_graph_theory","induction","degree_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2017-18-regional-friendship-triangle-factor минимум дружб при разбиении после удаления ребёнка на тройки, всероссийская олимпиада 2017/18 vosh всероссийская олимпиада 2017 graph_model extremal_graph_theory induction degree_counting construction goal_exact_bound берлов с.л. власова н. vosh-2017-18-regional-friendship-triangle-factor minimum druzhb pri razbienii posle udaleniya rebenka na troyki, vserossiyskaya olimpiada 2017/18 vosh vserossiyskaya olimpiada 2017 graph_model extremal_graph_theory induction degree_counting construction goal_exact_bound berlov s.l. vlasova n."}
{"id":"vosh-2018-19-final-shirt-recoloring","title":"Перекраска правильной 7-раскраски 11-регулярного графа, Всероссийская олимпиада 2018/19","path":"data\\problems\\vosh\\vosh-2018-19-final-shirt-recoloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2018-19-final-shirt-recoloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2018-19-final-shirt-recoloring","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2018","tags":["coloring","double_counting","pigeonhole_principle","degree_counting","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2018-19-final-shirt-recoloring перекраска правильной 7-раскраски 11-регулярного графа, всероссийская олимпиада 2018/19 vosh всероссийская олимпиада 2018 coloring double_counting pigeonhole_principle degree_counting goal_existence магазинов а. vosh-2018-19-final-shirt-recoloring perekraska pravilnoy 7-raskraski 11-regulyarnogo grafa, vserossiyskaya olimpiada 2018/19 vosh vserossiyskaya olimpiada 2018 coloring double_counting pigeonhole_principle degree_counting goal_existence magazinov a."}
{"id":"vosh-2022-23-final-optimal-road-networks","title":"Вложенные оптимальные ориентированные дорожные сети, Всероссийская олимпиада 2022/23","path":"data\\problems\\vosh\\vosh-2022-23-final-optimal-road-networks.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2022-23-final-optimal-road-networks.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2022-23-final-optimal-road-networks","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2022","tags":["trees","extremal_choice","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2022-23-final-optimal-road-networks вложенные оптимальные ориентированные дорожные сети, всероссийская олимпиада 2022/23 vosh всероссийская олимпиада 2022 trees extremal_choice goal_existence буслов в. vosh-2022-23-final-optimal-road-networks vlozhennye optimalnye orientirovannye dorozhnye seti, vserossiyskaya olimpiada 2022/23 vosh vserossiyskaya olimpiada 2022 trees extremal_choice goal_existence buslov v."}
{"id":"vosh-2022-23-regional-connected-country-cut","title":"Разбиение связного графа с перевесом рёбер разреза, Всероссийская олимпиада 2022/23","path":"data\\problems\\vosh\\vosh-2022-23-regional-connected-country-cut.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2022-23-regional-connected-country-cut.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2022-23-regional-connected-country-cut","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2022","tags":["connectivity","graph_cut","cut_counting","induction","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2022-23-regional-connected-country-cut разбиение связного графа с перевесом рёбер разреза, всероссийская олимпиада 2022/23 vosh всероссийская олимпиада 2022 connectivity graph_cut cut_counting induction goal_bound дидин м. а. vosh-2022-23-regional-connected-country-cut razbienie svyaznogo grafa s perevesom reber razreza, vserossiyskaya olimpiada 2022/23 vosh vserossiyskaya olimpiada 2022 connectivity graph_cut cut_counting induction goal_bound didin m. a."}
{"id":"vosh-2025-26-final-regions-friendship-coloring","title":"Участники из регионов, дружба и раскраска графа, Всероссийская олимпиада 2025/26","path":"data\\problems\\vosh\\vosh-2025-26-final-regions-friendship-coloring.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2025-26-final-regions-friendship-coloring.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2025-26-final-regions-friendship-coloring","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2025","tags":["coloring","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"vosh-2025-26-final-regions-friendship-coloring участники из регионов, дружба и раскраска графа, всероссийская олимпиада 2025/26 vosh всероссийская олимпиада 2025 coloring goal_existence vosh-2025-26-final-regions-friendship-coloring uchastniki iz regionov, druzhba i raskraska grafa, vserossiyskaya olimpiada 2025/26 vosh vserossiyskaya olimpiada 2025 coloring goal_existence"}
{"id":"vosh-2025-26-regional-common-neighborhood-red-pairs","title":"Пары незнакомых среди 100 знакомых, региональный этап ВсОШ 2025/26","path":"data\\problems\\vosh\\vosh-2025-26-regional-common-neighborhood-red-pairs.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2025-26-regional-common-neighborhood-red-pairs.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2025-26-regional-common-neighborhood-red-pairs","source_key":"vosh","source_keys":["vosh"],"source_label":"региональный этап ВсОШ","year":"2025","tags":["graph_model","extremal_graph_theory","complement_graph_transition","double_counting","degree_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2025-26-regional-common-neighborhood-red-pairs пары незнакомых среди 100 знакомых, региональный этап всош 2025/26 vosh региональный этап всош 2025 graph_model extremal_graph_theory complement_graph_transition double_counting degree_counting goal_exact_bound центральная предметно-методическая комиссия по математике vosh-2025-26-regional-common-neighborhood-red-pairs pary neznakomyh sredi 100 znakomyh, regionalnyy etap vsosh 2025/26 vosh regionalnyy etap vsosh 2025 graph_model extremal_graph_theory complement_graph_transition double_counting degree_counting goal_exact_bound tsentralnaya predmetno-metodicheskaya komissiya po matematike"}
{"id":"vosh-2025-26-regional-degree-difference-friendship","title":"Максимум рёбер при разности степеней соседей 1, Всероссийская олимпиада 2025/26","path":"data\\problems\\vosh\\vosh-2025-26-regional-degree-difference-friendship.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/vosh/vosh-2025-26-regional-degree-difference-friendship.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#vosh-2025-26-regional-degree-difference-friendship","source_key":"vosh","source_keys":["vosh"],"source_label":"Всероссийская олимпиада","year":"2025","tags":["extremal_graph_theory","degree_counting","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"vosh-2025-26-regional-degree-difference-friendship максимум рёбер при разности степеней соседей 1, всероссийская олимпиада 2025/26 vosh всероссийская олимпиада 2025 extremal_graph_theory degree_counting goal_exact_bound vosh-2025-26-regional-degree-difference-friendship maksimum reber pri raznosti stepeney sosedey 1, vserossiyskaya olimpiada 2025/26 vosh vserossiyskaya olimpiada 2025 extremal_graph_theory degree_counting goal_exact_bound"}
{"id":"yumt-2011-grand-round1-problem9","title":"Двухцветный граф без коротких одноцветных циклов, ЮМТ 2011","path":"data\\problems\\yumt\\yumt-2011-grand-round1-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2011-grand-round1-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2011-grand-round1-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2011","tags":["coloring","extremal_graph_theory","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2011-grand-round1-problem9 двухцветный граф без коротких одноцветных циклов, юмт 2011 yumt юмт 2011 coloring extremal_graph_theory goal_proof yumt-2011-grand-round1-problem9 dvuhtsvetnyy graf bez korotkih odnotsvetnyh tsiklov, yumt 2011 yumt yumt 2011 coloring extremal_graph_theory goal_proof"}
{"id":"yumt-2011-grand-round4-problem9","title":"Односторонние авиалинии между 2011 городами, ЮМТ 2011","path":"data\\problems\\yumt\\yumt-2011-grand-round4-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2011-grand-round4-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2011-grand-round4-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"Односторонние авиалинии между","year":"2011","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2011-grand-round4-problem9 односторонние авиалинии между 2011 городами, юмт 2011 yumt односторонние авиалинии между 2011 connectivity extremal_graph_theory goal_exact_bound yumt-2011-grand-round4-problem9 odnostoronnie avialinii mezhdu 2011 gorodami, yumt 2011 yumt odnostoronnie avialinii mezhdu 2011 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2011-premier-round4-problem1","title":"Орграф, устойчивый к удалению 10 дуг, ЮМТ 2011","path":"data\\problems\\yumt\\yumt-2011-premier-round4-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2011-premier-round4-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2011-premier-round4-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2011","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"yumt-2011-premier-round4-problem1 орграф, устойчивый к удалению 10 дуг, юмт 2011 yumt юмт 2011 connectivity goal_exact_bound yumt-2011-premier-round4-problem1 orgraf, ustoychivyy k udaleniyu 10 dug, yumt 2011 yumt yumt 2011 connectivity goal_exact_bound"}
{"id":"yumt-2012-start-round2-problem5","title":"Областные города и дороги, ЮМТ 2012","path":"data\\problems\\yumt\\yumt-2012-start-round2-problem5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2012-start-round2-problem5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2012-start-round2-problem5","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2012","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2012-start-round2-problem5 областные города и дороги, юмт 2012 yumt юмт 2012 connectivity extremal_graph_theory goal_exact_bound yumt-2012-start-round2-problem5 oblastnye goroda i dorogi, yumt 2012 yumt yumt 2012 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2012-start-round3-problem1","title":"Раскраска рёбер \\(K_{20}\\) в четыре цвета, ЮМТ 2012","path":"data\\problems\\yumt\\yumt-2012-start-round3-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2012-start-round3-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2012-start-round3-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2012","tags":["coloring","ramsey_theory","goal_construction"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"yumt-2012-start-round3-problem1 раскраска рёбер \\(k_{20}\\) в четыре цвета, юмт 2012 yumt юмт 2012 coloring ramsey_theory goal_construction yumt-2012-start-round3-problem1 raskraska reber \\(k_{20}\\) v chetyre tsveta, yumt 2012 yumt yumt 2012 coloring ramsey_theory goal_construction"}
{"id":"yumt-2012-start-team-olympiad-problem5","title":"Минимальный граф, различающий n вершин, ЮМТ 2012","path":"data\\problems\\yumt\\yumt-2012-start-team-olympiad-problem5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2012-start-team-olympiad-problem5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2012-start-team-olympiad-problem5","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2012","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2012-start-team-olympiad-problem5 минимальный граф, различающий n вершин, юмт 2012 yumt юмт 2012 connectivity extremal_graph_theory goal_exact_bound yumt-2012-start-team-olympiad-problem5 minimalnyy graf, razlichayuschiy n vershin, yumt 2012 yumt yumt 2012 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2013-start-round1-problem3","title":"Хорды по делимости на окружности, ЮМТ 2013","path":"data\\problems\\yumt\\yumt-2013-start-round1-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2013-start-round1-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2013-start-round1-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2013","tags":["goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2013-start-round1-problem3 хорды по делимости на окружности, юмт 2013 yumt юмт 2013 goal_existence yumt-2013-start-round1-problem3 hordy po delimosti na okruzhnosti, yumt 2013 yumt yumt 2013 goal_existence"}
{"id":"yumt-2013-start-round4-problem8","title":"Средние степени по двум классам вершин, ЮМТ 2013","path":"data\\problems\\yumt\\yumt-2013-start-round4-problem8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2013-start-round4-problem8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2013-start-round4-problem8","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2013","tags":["double_counting","goal_counting"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2013-start-round4-problem8 средние степени по двум классам вершин, юмт 2013 yumt юмт 2013 double_counting goal_counting yumt-2013-start-round4-problem8 srednie stepeni po dvum klassam vershin, yumt 2013 yumt yumt 2013 double_counting goal_counting"}
{"id":"yumt-2014-grand-round1-problem5","title":"В графе 3n вершин и 5n рёбер, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-grand-round1-problem5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-grand-round1-problem5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-grand-round1-problem5","source_key":"yumt","source_keys":["yumt","rmm"],"source_label":"ЮМТ","year":"2014","tags":["extremal_graph_theory","double_counting","pigeonhole_principle","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"external_published_solution_adapted","search_text":"yumt-2014-grand-round1-problem5 в графе 3n вершин и 5n рёбер, юмт 2014 yumt юмт 2014 extremal_graph_theory double_counting pigeonhole_principle goal_proof yumt-2014-grand-round1-problem5 v grafe 3n vershin i 5n reber, yumt 2014 yumt yumt 2014 extremal_graph_theory double_counting pigeonhole_principle goal_proof"}
{"id":"yumt-2014-grand-round2-problem9","title":"Планарный граф рёбер кубиков, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-grand-round2-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-grand-round2-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-grand-round2-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["planar_graphs","trees","induction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_full_solution","search_text":"yumt-2014-grand-round2-problem9 планарный граф рёбер кубиков, юмт 2014 yumt юмт 2014 planar_graphs trees induction goal_exact_bound yumt-2014-grand-round2-problem9 planarnyy graf reber kubikov, yumt 2014 yumt yumt 2014 planar_graphs trees induction goal_exact_bound"}
{"id":"yumt-2014-grand-round4-problem1","title":"Максимум цветов при одноцветной связности, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-grand-round4-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-grand-round4-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-grand-round4-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["connectivity","extremal_graph_theory","double_counting","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2014-grand-round4-problem1 максимум цветов при одноцветной связности, юмт 2014 yumt юмт 2014 connectivity extremal_graph_theory double_counting construction goal_exact_bound yumt-2014-grand-round4-problem1 maksimum tsvetov pri odnotsvetnoy svyaznosti, yumt 2014 yumt yumt 2014 connectivity extremal_graph_theory double_counting construction goal_exact_bound"}
{"id":"yumt-2014-junior-round1-problem1","title":"Два простых цикла одинаковой длины, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-junior-round1-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-junior-round1-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-junior-round1-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2014-junior-round1-problem1 два простых цикла одинаковой длины, юмт 2014 yumt юмт 2014 goal_proof yumt-2014-junior-round1-problem1 dva prostyh tsikla odinakovoy dliny, yumt 2014 yumt yumt 2014 goal_proof"}
{"id":"yumt-2014-start-final-problem1","title":"Циклы, разъединяющие мультиграф, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-start-final-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-start-final-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-start-final-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["connectivity","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2014-start-final-problem1 циклы, разъединяющие мультиграф, юмт 2014 yumt юмт 2014 connectivity goal_exact_bound yumt-2014-start-final-problem1 tsikly, razedinyayuschie multigraf, yumt 2014 yumt yumt 2014 connectivity goal_exact_bound"}
{"id":"yumt-2014-start-round1-problem1","title":"Пауки на каркасе тетраэдра, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-start-round1-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-start-round1-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-start-round1-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2014-start-round1-problem1 пауки на каркасе тетраэдра, юмт 2014 yumt юмт 2014 goal_exact_bound yumt-2014-start-round1-problem1 pauki na karkase tetraedra, yumt 2014 yumt yumt 2014 goal_exact_bound"}
{"id":"yumt-2014-start-round4-problem2","title":"Ферзи с ограничением на число побитых ранее, ЮМТ 2014","path":"data\\problems\\yumt\\yumt-2014-start-round4-problem2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2014-start-round4-problem2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2014-start-round4-problem2","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2014","tags":["pigeonhole_principle","degree_counting","graph_in_solution","trees","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_plan_completed_by_ai","search_text":"yumt-2014-start-round4-problem2 ферзи с ограничением на число побитых ранее, юмт 2014 yumt юмт 2014 pigeonhole_principle degree_counting graph_in_solution trees construction goal_exact_bound д.ю. кузнецов yumt-2014-start-round4-problem2 ferzi s ogranicheniem na chislo pobityh ranee, yumt 2014 yumt yumt 2014 pigeonhole_principle degree_counting graph_in_solution trees construction goal_exact_bound d.yu. kuznetsov"}
{"id":"yumt-2015-grand-final-problem5","title":"Граф без K5 и с хроматическим числом больше 4, ЮМТ 2015","path":"data\\problems\\yumt\\yumt-2015-grand-final-problem5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2015-grand-final-problem5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2015-grand-final-problem5","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2015","tags":["coloring","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"unofficial_published","search_text":"yumt-2015-grand-final-problem5 граф без k5 и с хроматическим числом больше 4, юмт 2015 yumt юмт 2015 coloring goal_impossibility yumt-2015-grand-final-problem5 graf bez k5 i s hromaticheskim chislom bolshe 4, yumt 2015 yumt yumt 2015 coloring goal_impossibility"}
{"id":"yumt-2015-grand-round3-problem9","title":"Гамильтонов цикл в Concur-Air влечёт гамильтонов цикл в Super-Air, ЮМТ 2015","path":"data\\problems\\yumt\\yumt-2015-grand-round3-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2015-grand-round3-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2015-grand-round3-problem9","source_key":"yumt","source_keys":["yumt","baltic"],"source_label":"ЮМТ","year":"2015","tags":["connectivity","hamiltonian_cycles","goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2015-grand-round3-problem9 гамильтонов цикл в concur-air влечёт гамильтонов цикл в super-air, юмт 2015 yumt юмт 2015 connectivity hamiltonian_cycles goal_characterization yumt-2015-grand-round3-problem9 gamiltonov tsikl v concur-air vlechet gamiltonov tsikl v super-air, yumt 2015 yumt yumt 2015 connectivity hamiltonian_cycles goal_characterization"}
{"id":"yumt-2015-grand-round4-problem10","title":"Пять авиакомпаний и связное подмножество аэропортов, ЮМТ 2015","path":"data\\problems\\yumt\\yumt-2015-grand-round4-problem10.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2015-grand-round4-problem10.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2015-grand-round4-problem10","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2015","tags":["coloring","ramsey_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2015-grand-round4-problem10 пять авиакомпаний и связное подмножество аэропортов, юмт 2015 yumt юмт 2015 coloring ramsey_theory goal_exact_bound yumt-2015-grand-round4-problem10 pyat aviakompaniy i svyaznoe podmnozhestvo aeroportov, yumt 2015 yumt yumt 2015 coloring ramsey_theory goal_exact_bound"}
{"id":"yumt-2015-start-round4-problem6","title":"Кольцевые автобусные маршруты в Орлятии, ЮМТ 2015","path":"data\\problems\\yumt\\yumt-2015-start-round4-problem6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2015-start-round4-problem6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2015-start-round4-problem6","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2015","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2015-start-round4-problem6 кольцевые автобусные маршруты в орлятии, юмт 2015 yumt юмт 2015 extremal_graph_theory goal_exact_bound yumt-2015-start-round4-problem6 koltsevye avtobusnye marshruty v orlyatii, yumt 2015 yumt yumt 2015 extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2016-start-high-round1-problem7","title":"Независимые множества в графе ходов коня, ЮМТ 2016","path":"data\\problems\\yumt\\yumt-2016-start-high-round1-problem7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2016-start-high-round1-problem7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2016-start-high-round1-problem7","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2016","tags":["graph_model","matching","coloring","goal_counting","goal_classification"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2016-start-high-round1-problem7 независимые множества в графе ходов коня, юмт 2016 yumt юмт 2016 graph_model matching coloring goal_counting goal_classification yumt-2016-start-high-round1-problem7 nezavisimye mnozhestva v grafe hodov konya, yumt 2016 yumt yumt 2016 graph_model matching coloring goal_counting goal_classification"}
{"id":"yumt-2016-team-olympiad-9-11-problem8","title":"Развороты авиарейсов вместо закрытия рёбер, ЮМТ 2016","path":"data\\problems\\yumt\\yumt-2016-team-olympiad-9-11-problem8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2016-team-olympiad-9-11-problem8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2016-team-olympiad-9-11-problem8","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2016","tags":["goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2016-team-olympiad-9-11-problem8 развороты авиарейсов вместо закрытия рёбер, юмт 2016 yumt юмт 2016 goal_impossibility yumt-2016-team-olympiad-9-11-problem8 razvoroty aviareysov vmesto zakrytiya reber, yumt 2016 yumt yumt 2016 goal_impossibility"}
{"id":"yumt-2017-premier-round1-problem2","title":"Министры Петя и Вася на карте городов, ЮМТ 2017","path":"data\\problems\\yumt\\yumt-2017-premier-round1-problem2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2017-premier-round1-problem2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2017-premier-round1-problem2","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2017","tags":["goal_strategy_game","construction","goal_exact_bound"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2017-premier-round1-problem2 министры петя и вася на карте городов, юмт 2017 yumt юмт 2017 goal_strategy_game construction goal_exact_bound yumt-2017-premier-round1-problem2 ministry petya i vasya na karte gorodov, yumt 2017 yumt yumt 2017 goal_strategy_game construction goal_exact_bound"}
{"id":"yumt-2017-start-first-round1-problem3","title":"Петя разрушает дороги, Вася ведёт фишку, ЮМТ 2017","path":"data\\problems\\yumt\\yumt-2017-start-first-round1-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2017-start-first-round1-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2017-start-first-round1-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2017","tags":["goal_strategy_game","construction","goal_exact_bound"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2017-start-first-round1-problem3 петя разрушает дороги, вася ведёт фишку, юмт 2017 yumt юмт 2017 goal_strategy_game construction goal_exact_bound yumt-2017-start-first-round1-problem3 petya razrushaet dorogi, vasya vedet fishku, yumt 2017 yumt yumt 2017 goal_strategy_game construction goal_exact_bound"}
{"id":"yumt-2017-start-high-round1-problem3","title":"Петя разрушает дороги, Вася едет не более чем по двум дорогам, ЮМТ 2017","path":"data\\problems\\yumt\\yumt-2017-start-high-round1-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2017-start-high-round1-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2017-start-high-round1-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2017","tags":["goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2017-start-high-round1-problem3 петя разрушает дороги, вася едет не более чем по двум дорогам, юмт 2017 yumt юмт 2017 goal_strategy_game yumt-2017-start-high-round1-problem3 petya razrushaet dorogi, vasya edet ne bolee chem po dvum dorogam, yumt 2017 yumt yumt 2017 goal_strategy_game"}
{"id":"yumt-2018-grand-final-problem1","title":"Игра на связном графе с числами в вершинах, ЮМТ 2018","path":"data\\problems\\yumt\\yumt-2018-grand-final-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2018-grand-final-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2018-grand-final-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2018","tags":["connectivity","goal_strategy_game","invariant"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2018-grand-final-problem1 игра на связном графе с числами в вершинах, юмт 2018 yumt юмт 2018 connectivity goal_strategy_game invariant yumt-2018-grand-final-problem1 igra na svyaznom grafe s chislami v vershinah, yumt 2018 yumt yumt 2018 connectivity goal_strategy_game invariant"}
{"id":"yumt-2018-grand-round1-problem3","title":"Связный граф на 100 вершинах, ЮМТ 2018","path":"data\\problems\\yumt\\yumt-2018-grand-round1-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2018-grand-round1-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2018-grand-round1-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2018","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2018-grand-round1-problem3 связный граф на 100 вершинах, юмт 2018 yumt юмт 2018 connectivity extremal_graph_theory goal_exact_bound yumt-2018-grand-round1-problem3 svyaznyy graf na 100 vershinah, yumt 2018 yumt yumt 2018 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2019-start-first-round4-problem1","title":"Круговые маршруты из 3, 4, 5, 6, 7 и 8 дорог, ЮМТ 2019","path":"data\\problems\\yumt\\yumt-2019-start-first-round4-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2019-start-first-round4-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2019-start-first-round4-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2019","tags":["connectivity","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2019-start-first-round4-problem1 круговые маршруты из 3, 4, 5, 6, 7 и 8 дорог, юмт 2019 yumt юмт 2019 connectivity extremal_graph_theory goal_exact_bound yumt-2019-start-first-round4-problem1 krugovye marshruty iz 3, 4, 5, 6, 7 i 8 dorog, yumt 2019 yumt yumt 2019 connectivity extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2019-start-high-round1-problem7","title":"Степени вершин связного графа, ЮМТ 2019","path":"data\\problems\\yumt\\yumt-2019-start-high-round1-problem7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2019-start-high-round1-problem7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2019-start-high-round1-problem7","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2019","tags":["connectivity","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2019-start-high-round1-problem7 степени вершин связного графа, юмт 2019 yumt юмт 2019 connectivity goal_existence yumt-2019-start-high-round1-problem7 stepeni vershin svyaznogo grafa, yumt 2019 yumt yumt 2019 connectivity goal_existence"}
{"id":"yumt-2020-100-v-shapes-disjoint","title":"100 попарно рёберно-непересекающихся галочек в графе, ЮМТ 2020","path":"data\\problems\\yumt\\yumt-2020-100-v-shapes-disjoint.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2020-100-v-shapes-disjoint.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2020-100-v-shapes-disjoint","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2020","tags":["extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2020-100-v-shapes-disjoint 100 попарно рёберно-непересекающихся галочек в графе, юмт 2020 yumt юмт 2020 extremal_graph_theory goal_exact_bound yumt-2020-100-v-shapes-disjoint 100 poparno reberno-neperesekayuschihsya galochek v grafe, yumt 2020 yumt yumt 2020 extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2020-start-round1-problem4","title":"Граф без изолированных вершин с ограничением на четвёрки, ЮМТ 2020","path":"data\\problems\\yumt\\yumt-2020-start-round1-problem4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2020-start-round1-problem4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2020-start-round1-problem4","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2020","tags":["extremal_graph_theory","goal_exact_bound","construction","degree_counting","connectivity","matching"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_repaired_complete","search_text":"yumt-2020-start-round1-problem4 граф без изолированных вершин с ограничением на четвёрки, юмт 2020 yumt юмт 2020 extremal_graph_theory goal_exact_bound construction degree_counting connectivity matching yumt-2020-start-round1-problem4 graf bez izolirovannyh vershin s ogranicheniem na chetverki, yumt 2020 yumt yumt 2020 extremal_graph_theory goal_exact_bound construction degree_counting connectivity matching"}
{"id":"yumt-2020-start-round2-problem4","title":"Двухцветная раскраска рёбер связного графа, ЮМТ 2020","path":"data\\problems\\yumt\\yumt-2020-start-round2-problem4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2020-start-round2-problem4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2020-start-round2-problem4","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2020","tags":["coloring","connectivity","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2020-start-round2-problem4 двухцветная раскраска рёбер связного графа, юмт 2020 yumt юмт 2020 coloring connectivity goal_proof yumt-2020-start-round2-problem4 dvuhtsvetnaya raskraska reber svyaznogo grafa, yumt 2020 yumt yumt 2020 coloring connectivity goal_proof"}
{"id":"yumt-2021-grand-final-problem7","title":"Раскраска графа без K4, ЮМТ 2021","path":"data\\problems\\yumt\\yumt-2021-grand-final-problem7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2021-grand-final-problem7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2021-grand-final-problem7","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2021","tags":["coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2021-grand-final-problem7 раскраска графа без k4, юмт 2021 yumt юмт 2021 coloring goal_proof yumt-2021-grand-final-problem7 raskraska grafa bez k4, yumt 2021 yumt yumt 2021 coloring goal_proof"}
{"id":"yumt-2021-grand-round1-problem2","title":"Число клик в графе, ЮМТ 2021","path":"data\\problems\\yumt\\yumt-2021-grand-round1-problem2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2021-grand-round1-problem2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2021-grand-round1-problem2","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2021","tags":["double_counting","extremal_graph_theory","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2021-grand-round1-problem2 число клик в графе, юмт 2021 yumt юмт 2021 double_counting extremal_graph_theory goal_bound yumt-2021-grand-round1-problem2 chislo klik v grafe, yumt 2021 yumt yumt 2021 double_counting extremal_graph_theory goal_bound"}
{"id":"yumt-2021-grand-round4-problem3","title":"Цветочередующийся цикл, ЮМТ 2021","path":"data\\problems\\yumt\\yumt-2021-grand-round4-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2021-grand-round4-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2021-grand-round4-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2021","tags":["coloring","matching","trees","connectivity","classical_lemma","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"classical_external_lemma_application","search_text":"yumt-2021-grand-round4-problem3 цветочередующийся цикл, юмт 2021 yumt юмт 2021 coloring matching trees connectivity classical_lemma goal_proof yumt-2021-grand-round4-problem3 tsvetochereduyuschiysya tsikl, yumt 2021 yumt yumt 2021 coloring matching trees connectivity classical_lemma goal_proof"}
{"id":"yumt-2022-grand-final-problem1","title":"Связный граф и нечётные циклы, ЮМТ 2022","path":"data\\problems\\yumt\\yumt-2022-grand-final-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2022-grand-final-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2022-grand-final-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2022","tags":["coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"heavy_external_theorem_application","search_text":"yumt-2022-grand-final-problem1 связный граф и нечётные циклы, юмт 2022 yumt юмт 2022 coloring goal_proof yumt-2022-grand-final-problem1 svyaznyy graf i nechetnye tsikly, yumt 2022 yumt yumt 2022 coloring goal_proof"}
{"id":"yumt-2022-start-final-problem6","title":"Большое независимое множество, ЮМТ 2022","path":"data\\problems\\yumt\\yumt-2022-start-final-problem6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2022-start-final-problem6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2022-start-final-problem6","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2022","tags":["extremal_graph_theory","matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2022-start-final-problem6 большое независимое множество, юмт 2022 yumt юмт 2022 extremal_graph_theory matching goal_proof yumt-2022-start-final-problem6 bolshoe nezavisimoe mnozhestvo, yumt 2022 yumt yumt 2022 extremal_graph_theory matching goal_proof"}
{"id":"yumt-2023-granda-final-problem6","title":"Разбиение графа по хроматическим числам, ЮМТ 2023","path":"data\\problems\\yumt\\yumt-2023-granda-final-problem6.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2023-granda-final-problem6.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2023-granda-final-problem6","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2023","tags":["coloring","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"published_complete","search_text":"yumt-2023-granda-final-problem6 разбиение графа по хроматическим числам, юмт 2023 yumt юмт 2023 coloring goal_existence дольников в.л. yumt-2023-granda-final-problem6 razbienie grafa po hromaticheskim chislam, yumt 2023 yumt yumt 2023 coloring goal_existence dolnikov v.l."}
{"id":"yumt-2023-granda-round2-problem9","title":"Выбор вершин по граням плоского двудольного графа, ЮМТ 2023","path":"data\\problems\\yumt\\yumt-2023-granda-round2-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2023-granda-round2-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2023-granda-round2-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2023","tags":["matching","planar_graphs","goal_existence"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2023-granda-round2-problem9 выбор вершин по граням плоского двудольного графа, юмт 2023 yumt юмт 2023 matching planar_graphs goal_existence yumt-2023-granda-round2-problem9 vybor vershin po granyam ploskogo dvudolnogo grafa, yumt 2023 yumt yumt 2023 matching planar_graphs goal_existence"}
{"id":"yumt-2023-granda-round4-problem3","title":"Удаление двух рёбер с общим концом, ЮМТ 2023","path":"data\\problems\\yumt\\yumt-2023-granda-round4-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2023-granda-round4-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2023-granda-round4-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2023","tags":["connectivity","extremal_graph_theory","construction","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2023-granda-round4-problem3 удаление двух рёбер с общим концом, юмт 2023 yumt юмт 2023 connectivity extremal_graph_theory construction goal_exact_bound yumt-2023-granda-round4-problem3 udalenie dvuh reber s obschim kontsom, yumt 2023 yumt yumt 2023 connectivity extremal_graph_theory construction goal_exact_bound"}
{"id":"yumt-2024-grand-final-problem9","title":"Выбор рёбер из 4-циклов, ЮМТ 2024","path":"data\\problems\\yumt\\yumt-2024-grand-final-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2024-grand-final-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2024-grand-final-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2024","tags":["matching","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2024-grand-final-problem9 выбор рёбер из 4-циклов, юмт 2024 yumt юмт 2024 matching goal_proof yumt-2024-grand-final-problem9 vybor reber iz 4-tsiklov, yumt 2024 yumt yumt 2024 matching goal_proof"}
{"id":"yumt-2024-grand-round3-problem8","title":"Один и тот же граф после удаления двух вершин, ЮМТ 2024","path":"data\\problems\\yumt\\yumt-2024-grand-round3-problem8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2024-grand-round3-problem8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2024-grand-round3-problem8","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2024","tags":["degree_counting","invariant","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2024-grand-round3-problem8 один и тот же граф после удаления двух вершин, юмт 2024 yumt юмт 2024 degree_counting invariant goal_proof yumt-2024-grand-round3-problem8 odin i tot zhe graf posle udaleniya dvuh vershin, yumt 2024 yumt yumt 2024 degree_counting invariant goal_proof"}
{"id":"yumt-2024-start-final-problem7","title":"Поиск диаметра скрытого дерева, ЮМТ 2024","path":"data\\problems\\yumt\\yumt-2024-start-final-problem7.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2024-start-final-problem7.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2024-start-final-problem7","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2024","tags":["trees","goal_algorithm"],"agent_topics":["game_strategy_candidate"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2024-start-final-problem7 поиск диаметра скрытого дерева, юмт 2024 yumt юмт 2024 trees goal_algorithm yumt-2024-start-final-problem7 poisk diametra skrytogo dereva, yumt 2024 yumt yumt 2024 trees goal_algorithm"}
{"id":"yumt-2024-unior-final-problem2","title":"Трёхцветная раскраска графа, ЮМТ 2024","path":"data\\problems\\yumt\\yumt-2024-unior-final-problem2.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2024-unior-final-problem2.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2024-unior-final-problem2","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2024","tags":["coloring","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2024-unior-final-problem2 трёхцветная раскраска графа, юмт 2024 yumt юмт 2024 coloring goal_proof yumt-2024-unior-final-problem2 trehtsvetnaya raskraska grafa, yumt 2024 yumt yumt 2024 coloring goal_proof"}
{"id":"yumt-2025-grand-final-problem5","title":"Наибольший гарантированный выигрыш на связном графе, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-grand-final-problem5.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-grand-final-problem5.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-grand-final-problem5","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["connectivity","goal_strategy_game"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-grand-final-problem5 наибольший гарантированный выигрыш на связном графе, юмт 2025 yumt юмт 2025 connectivity goal_strategy_game yumt-2025-grand-final-problem5 naibolshiy garantirovannyy vyigrysh na svyaznom grafe, yumt 2025 yumt yumt 2025 connectivity goal_strategy_game"}
{"id":"yumt-2025-grand-round1-problem4","title":"Дерево и графики многочленов, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-grand-round1-problem4.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-grand-round1-problem4.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-grand-round1-problem4","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["construction","goal_impossibility"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-grand-round1-problem4 дерево и графики многочленов, юмт 2025 yumt юмт 2025 construction goal_impossibility yumt-2025-grand-round1-problem4 derevo i grafiki mnogochlenov, yumt 2025 yumt yumt 2025 construction goal_impossibility"}
{"id":"yumt-2025-grand-round1-problem9","title":"Трёхцветная раскраска рёбер полного графа, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-grand-round1-problem9.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-grand-round1-problem9.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-grand-round1-problem9","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["coloring","extremal_graph_theory","goal_exact_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-grand-round1-problem9 трёхцветная раскраска рёбер полного графа, юмт 2025 yumt юмт 2025 coloring extremal_graph_theory goal_exact_bound yumt-2025-grand-round1-problem9 trehtsvetnaya raskraska reber polnogo grafa, yumt 2025 yumt yumt 2025 coloring extremal_graph_theory goal_exact_bound"}
{"id":"yumt-2025-grand-round2-problem1","title":"Диаметр 2α - 1 и разбиение на клики, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-grand-round2-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-grand-round2-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-grand-round2-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["extremal_graph_theory","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-grand-round2-problem1 диаметр 2α - 1 и разбиение на клики, юмт 2025 yumt юмт 2025 extremal_graph_theory goal_proof yumt-2025-grand-round2-problem1 diametr 2α - 1 i razbienie na kliki, yumt 2025 yumt yumt 2025 extremal_graph_theory goal_proof"}
{"id":"yumt-2025-grand-round4-problem3","title":"Игра Зайца и Волка на раскрашенном графе, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-grand-round4-problem3.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-grand-round4-problem3.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-grand-round4-problem3","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["coloring","goal_strategy_game","goal_characterization","goal_algorithm"],"agent_topics":["game_strategy"],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-grand-round4-problem3 игра зайца и волка на раскрашенном графе, юмт 2025 yumt юмт 2025 coloring goal_strategy_game goal_characterization goal_algorithm дидин м. а. yumt-2025-grand-round4-problem3 igra zaytsa i volka na raskrashennom grafe, yumt 2025 yumt yumt 2025 coloring goal_strategy_game goal_characterization goal_algorithm didin m. a."}
{"id":"yumt-2025-unior-round1-problem1","title":"Разбиение на k лесов, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-unior-round1-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-unior-round1-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-unior-round1-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["trees","goal_proof"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"official_complete_or_near_complete","search_text":"yumt-2025-unior-round1-problem1 разбиение на k лесов, юмт 2025 yumt юмт 2025 trees goal_proof yumt-2025-unior-round1-problem1 razbienie na k lesov, yumt 2025 yumt yumt 2025 trees goal_proof"}
{"id":"yumt-2025-unior-round1-problem8","title":"Цикл и квадратные трёхчлены, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-unior-round1-problem8.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-unior-round1-problem8.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-unior-round1-problem8","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["goal_characterization"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"ai_original","search_text":"yumt-2025-unior-round1-problem8 цикл и квадратные трёхчлены, юмт 2025 yumt юмт 2025 goal_characterization yumt-2025-unior-round1-problem8 tsikl i kvadratnye trehchleny, yumt 2025 yumt yumt 2025 goal_characterization"}
{"id":"yumt-2025-unior-round3-problem1","title":"Циклы длины не меньше 5, ЮМТ 2025","path":"data\\problems\\yumt\\yumt-2025-unior-round3-problem1.yaml","raw_github_url":"https://raw.githubusercontent.com/didin-maxim/knowledge_graph_of_graphs/main/data/problems/yumt/yumt-2025-unior-round3-problem1.yaml","viewer_url":"https://didin-maxim.github.io/knowledge_graph_of_graphs/#yumt-2025-unior-round3-problem1","source_key":"yumt","source_keys":["yumt"],"source_label":"ЮМТ","year":"2025","tags":["extremal_graph_theory","classical_lemma","double_counting","goal_bound"],"agent_topics":[],"solution_state":"with_solution","solution_classification_type":"original_ai_solution","search_text":"yumt-2025-unior-round3-problem1 циклы длины не меньше 5, юмт 2025 yumt юмт 2025 extremal_graph_theory classical_lemma double_counting goal_bound yumt-2025-unior-round3-problem1 tsikly dliny ne menshe 5, yumt 2025 yumt yumt 2025 extremal_graph_theory classical_lemma double_counting goal_bound"}