{"id":22156229,"url":"https://github.com/andy489/combinatorics_and_graphs","last_synced_at":"2026-03-19T22:00:54.242Z","repository":{"id":129116668,"uuid":"384536013","full_name":"andy489/Combinatorics_and_Graphs","owner":"andy489","description":"Generating functions. Involution. Special Numbers (Catalan, Euler, Eulerian, Euler zigzag, Stirling, Bell, etc.). Approximations. Pólya's theory for counting. Hall's marriage theorem. Paths in an integer lattice. Kummer's, Legendre's and Lucas's Theorems and more.","archived":false,"fork":false,"pushed_at":"2021-12-19T21:22:46.000Z","size":38123,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-23T22:30:48.399Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Pascal","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/andy489.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-07-09T19:43:59.000Z","updated_at":"2023-01-12T20:49:35.000Z","dependencies_parsed_at":"2023-04-25T02:46:42.554Z","dependency_job_id":null,"html_url":"https://github.com/andy489/Combinatorics_and_Graphs","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/andy489/Combinatorics_and_Graphs","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andy489%2FCombinatorics_and_Graphs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andy489%2FCombinatorics_and_Graphs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andy489%2FCombinatorics_and_Graphs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andy489%2FCombinatorics_and_Graphs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/andy489","download_url":"https://codeload.github.com/andy489/Combinatorics_and_Graphs/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andy489%2FCombinatorics_and_Graphs/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29398587,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-13T06:24:03.484Z","status":"ssl_error","status_checked_at":"2026-02-13T06:23:12.830Z","response_time":78,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-12-02T02:38:53.665Z","updated_at":"2026-02-13T07:34:16.094Z","avatar_url":"https://github.com/andy489.png","language":"Pascal","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Selected Chapters from Combinatorics and Graph Theory\n\n## Lectures\n\nN|date|pdf\n:-:|:-:|:-\n01|2021-05-25|[(**Л**) Пораждащи функции. Рекурентни уравнения. **Инволюция**.](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/01%20%D0%9B%20(2021-02-25)%20%D0%9F%D0%BE%D1%80%D0%B0%D0%B6%D0%B4%D0%B0%D1%89%D0%B8%20%D1%84%D1%83%D0%BD%D0%BA%D1%86%D0%B8%D0%B8.%20%D0%A0%D0%B5%D0%BA%D1%83%D1%80%D0%B5%D0%BD%D1%82%D0%BD%D0%B8%20%D1%83%D1%80%D0%B0%D0%B2%D0%BD%D0%B5%D0%BD%D0%B8%D1%8F.%20%D0%98%D0%BD%D0%B2%D0%BE%D0%BB%D1%8E%D1%86%D0%B8%D1%8F.pdf)\n02|2021-03-04|[(**Л**) Комбинаторни тъждества. Формула на Стирлинг. Терема на Льожандер. Теорема на Люка. Теорема на Кумер](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/02%20%D0%9B%20(2021-03-04)%20%D0%9A%D0%BE%D0%BC%D0%B1%D0%B8%D0%BD%D0%B0%D1%82%D0%BE%D1%80%D0%BD%D0%B8%20%D1%82%D1%8A%D0%B6%D0%B4%D0%B5%D1%81%D1%82%D0%B2%D0%B0.%20%D0%A4%D0%BE%D1%80%D0%BC%D1%83%D0%BB%D0%B0%20%D0%BD%D0%B0%20%D0%A1%D1%82%D0%B8%D1%80%D0%BB%D0%B8%D0%BD%D0%B3.%20%D0%A2%D0%B5%D1%80%D0%B5%D0%BC%D0%B0%20%D0%BD%D0%B0%20%D0%9B%D1%8C%D0%BE%D0%B6%D0%B0%D0%BD%D0%B4%D0%B5%D1%80.%20%D0%A2%D0%B5%D0%BE%D1%80%D0%B5%D0%BC%D0%B0%20%D0%BD%D0%B0%20%D0%9B%D1%8E%D0%BA%D0%B0.%20%D0%A2%D0%B5%D0%BE%D1%80%D0%B5%D0%BC%D0%B0%20%D0%BD%D0%B0%20%D0%9A%D1%83%D0%BC%D0%B5%D1%80.pdf)\u003cbr\u003e[2.1. Wilf–Zeilberger pairs](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/02.1%20Wilf%E2%80%93Zeilberger%20pairs.pdf)\u003cbr\u003e[2.2. WZ-method – Examples](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/02.2%20WZ-method%20%E2%80%93%20Examples.pdf)\u003cbr\u003e[2.3. Gosper algorithm for finding WZ pairs](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/02.3%20Gosper%20algorithm%20for%20finding%20WZ%20pairs.pdf)\n03|2021-03-11|[(**Л**) Разбиване на естествено число. Диаграми на Юнг. Числа на Каталан.](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/03%20%D0%9B%20(2021-03-11)%20%D0%A0%D0%B0%D0%B7%D0%B1%D0%B8%D0%B2%D0%B0%D0%BD%D0%B5%20%D0%BD%D0%B0%20%D0%B5%D1%81%D1%82%D0%B5%D1%81%D1%82%D0%B2%D0%B5%D0%BD%D0%BE%20%D1%87%D0%B8%D1%81%D0%BB%D0%BE.%20%D0%94%D0%B8%D0%B0%D0%B3%D1%80%D0%B0%D0%BC%D0%B8%20%D0%BD%D0%B0%20%D0%AE%D0%BD%D0%B3.%20%D0%A7%D0%B8%D1%81%D0%BB%D0%B0%20%D0%BD%D0%B0%20%D0%9A%D0%B0%D1%82%D0%B0%D0%BB%D0%B0%D0%BD.pdf)\u003cbr\u003e[3.1. Catalan Numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/03.1%20Catalan%20Numbers.pdf)\u003cbr\u003e[3.2. Lectures on Integer Partitions (by Herbert Wilf)](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/03.2%20Lectures%20on%20Integer%20Partitions%20(by%20Herbert%20Wilf).pdf)\n04|2021-03-18|[(**Л**) Специални числа. Числа на Стирлинг, Бел, Ойлер](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04%20%D0%9B%20(2021-03-18(21))%20%D0%A1%D0%BF%D0%B5%D1%86%D0%B8%D0%B0%D0%BB%D0%BD%D0%B8%20%D1%87%D0%B8%D1%81%D0%BB%D0%B0.%20%D0%A7%D0%B8%D1%81%D0%BB%D0%B0%20%D0%BD%D0%B0%20%D0%A1%D1%82%D0%B8%D1%80%D0%BB%D0%B8%D0%BD%D0%B3%2C%20%D0%91%D0%B5%D0%BB%2C%20%D0%9E%D0%B8%CC%86%D0%BB%D0%B5%D1%80.pdf)\u003cbr\u003e[4.1. Stirling Numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04.1%20Stirling%20Numbers.pdf)\u003cbr\u003e[4.2. Stirling Numbers of the First Kind](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04.2%20Stirling%20Numbers%20of%20the%20First%20Kind.pdf)\u003cbr\u003e[4.3. Stirling Numbers of the Second Kind](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04.3%20Stirling%20Numbers%20of%20the%20Second%20Kind.pdf)\u003cbr\u003e[4.4. Bell numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04.4%20Bell%20Number.pdf)\u003cbr\u003e[4.5. Eulerian Numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/04.5%20Eulerian%20Numbers.pdf)\n05|2021-03-25|[(**Л**) Числа на Ойлер за броя на зигзагообразните пермутации и за реципрочния хиперболичен косинус](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/05%20%D0%9B%20(2021-03-25)%20%20%D0%A7%D0%B8%D1%81%D0%BB%D0%B0%20%D0%BD%D0%B0%20%D0%9E%D0%B8%CC%86%D0%BB%D0%B5%D1%80%20%D0%B7%D0%B0%20%D0%B1%D1%80%D0%BE%D1%8F%20%D0%BD%D0%B0%20%D0%B7%D0%B8%D0%B3%D0%B7%D0%B0%D0%B3%D0%BE%D0%BE%D0%B1%D1%80%D0%B0%D0%B7%D0%BD%D0%B8%D1%82%D0%B5%20%D0%BF%D0%B5%D1%80%D0%BC%D1%83%D1%82%D0%B0%D1%86%D0%B8%D0%B8%20%D0%B8%20%D0%B7%D0%B0%20%D1%80%D0%B5%D1%86%D0%B8%D0%BF%D1%80%D0%BE%D1%87%D0%BD%D0%B8%D1%8F%20%D1%85%D0%B8%D0%BF%D0%B5%D1%80%D0%B1%D0%BE%D0%BB%D0%B8%D1%87%D0%B5%D0%BD%20%D0%BA%D0%BE%D1%81%D0%B8%D0%BD%D1%83%D1%81.pdf)\u003cbr\u003e[5.1. Euler Numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/05.1%20Euler%20Numbers.pdf)\u003cbr\u003e[5.2. Euler Zigzag Numbers](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/05.2%20Euler%20Zigzag%20Numbers.pdf)\n06|2021-04-01|[(**Л**) Броене на съществено различими конфигурации. **Лема на Бърнсайд**](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/06%20%D0%9B%20(2021-04-01)%20%D0%91%D1%80%D0%BE%D0%B5%D0%BD%D0%B5%20%D0%BD%D0%B0%20%D1%81%D1%8A%D1%89%D0%B5%D1%81%D1%82%D0%B2%D0%B5%D0%BD%D0%BE%20%D1%80%D0%B0%D0%B7%D0%BB%D0%B8%D1%87%D0%B8%D0%BC%D0%B8%20%D0%BA%D0%BE%D0%BD%D1%84%D0%B8%D0%B3%D1%83%D1%80%D0%B0%D1%86%D0%B8%D0%B8.%20%D0%9B%D0%B5%D0%BC%D0%B0%20%D0%BD%D0%B0%20%D0%91%D1%8A%D1%80%D0%BD%D1%81%D0%B0%D0%B8%CC%86%D0%B4.pdf)\u003cbr\u003e[06.1. Видове съединиения в комбинаториката](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/06.1%20%D0%92%D0%B8%D0%B4%D0%BE%D0%B2%D0%B5%20%D1%81%D1%8A%D0%B5%D0%B4%D0%B8%D0%BD%D0%B8%D0%B5%D0%BD%D0%B8%D1%8F%20%D0%B2%20%D0%BA%D0%BE%D0%BC%D0%B1%D0%B8%D0%BD%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D0%BA%D0%B0%D1%82%D0%B0.pdf)\u003cbr\u003e[06.2. Combinatoric Configurations Applications](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/06.2%20Combinatoric%20Configurations%20Applications.pdf)\n07|2021-04-08|[(**Л**) **Теория на Пойа за броене**](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/07%20%D0%9B%20(2021-04-08)%20%D0%A2%D0%B5%D0%BE%D1%80%D0%B8%D1%8F%20%D0%BD%D0%B0%20%D0%9F%D0%BE%D0%B8%CC%86%D0%B0%20%D0%B7%D0%B0%20%D0%B1%D1%80%D0%BE%D0%B5%D0%BD%D0%B5.pdf)\u003cbr\u003e[07.1. Möbius Function](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/07.1%20Mo%CC%88bius%20Function.pdf)\u003cbr\u003e[07.2. Lyndon Words](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/07.2%20Lyndon%20Words.pdf)\u003cbr\u003e[07.3. de Bruijn Sequences](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/07.3%20de%20Bruijn%20Sequences.pdf)\u003cbr\u003e[07.4. Necklaces and Bracelets](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/07.4%20Necklaces%20and%20Bracelets.pdf)\n08|2021-04-22|[(**Л**) Пътища в целочислена решетка. **Теорема на Хол за сватбите**. Съчетание (сдвояване) в граф.](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/08%20%D0%9B%20(2021-04-22)%20%D0%9F%D1%8A%D1%82%D0%B8%D1%89%D0%B0%20%D0%B2%20%D1%86%D0%B5%D0%BB%D0%BE%D1%87%D0%B8%D1%81%D0%BB%D0%B5%D0%BD%D0%B0%20%D1%80%D0%B5%D1%88%D0%B5%D1%82%D0%BA%D0%B0.%20%D0%A2%D0%B5%D0%BE%D1%80%D0%B5%D0%BC%D0%B0%20%D0%BD%D0%B0%20%D0%A5%D0%BE%D0%BB%20%D0%B7%D0%B0%20%D1%81%D0%B2%D0%B0%D1%82%D0%B1%D0%B8%D1%82%D0%B5.%20%D0%A1%D1%8A%D1%87%D0%B5%D1%82%D0%B0%D0%BD%D0%B8%D0%B5%20(%D1%81%D0%B4%D0%B2%D0%BE%D1%8F%D0%B2%D0%B0%D0%BD%D0%B5)%20%D0%B2%20%D0%B3%D1%80%D0%B0%D1%84.pdf)\u003cbr\u003e[08.1. Count Dyck Paths](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/08.1%20Count%20Dyck%20Paths.pdf)\n09|2021-05-06|[09.1. Labeled Trees and Prüfer Sequences](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/09.1%20Labeled%20Trees%20and%20Pru%CC%88fer%20Sequences.pdf)\u003cbr\u003e[09.2. Cayley Formula – Counting Trees (proof by double counting)](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/09.2%20Cayley%20Formula%20%E2%80%93%20Counting%20Trees%20(proof%20by%20double%20counting).pdf)\u003cbr\u003e[09.3. On Cayley Enumeration of Alkanes (or 4-Valent Trees)](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/09.3%20On%20Cayley%20Enumeration%20of%20Alkanes%20(or%204-Valent%20Trees).pdf)\n10|2021-05-13|[10.1. Combinatorial Optimization and Combinatorial Structure in Computational Biology](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/10.1%20Combinatorial%20Optimization%20and%20Combinatorial%20Structure%20in%20Computational%20Biology.pdf)\u003cbr\u003e[10.2. Alkanes and Building Plots](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/10.2%20Alkanes%20and%20Building%20Plots.pdf)\u003cbr\u003e[10.3. Number of Melodies](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/L/10.3%20Number%20of%20Melodies.pdf)\n\n## Control Tests \u0026 Exams\n\nN|pdf\n:-:|:-\n01|[2016/2017 Exam preparation](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/01.%20%D0%9F%D0%BE%D0%B4%D0%B3%D0%BE%D1%82%D0%BE%D0%B2%D0%BA%D0%B0%20%D0%B7%D0%B0%20%D0%B8%D0%B7%D0%BF%D0%B8%D1%82%20%D0%BF%D1%80%D0%B5%D0%B7%20%D0%BB%D0%B5%D1%82%D0%BD%D0%B8%D1%8F%20%D1%81%D0%B5%D0%BC%D0%B5%D1%81%D1%82%D1%8A%D1%80%20%D0%BD%D0%B0%202016-2017%20%D1%83%D1%87.%20%D0%B3..pdf)\n02|[2016/2017 Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/02.%20%D0%98%D0%B7%D0%BF%D0%B8%D1%82%20%D0%BF%D1%80%D0%B5%D0%B7%20%D0%BB%D0%B5%D1%82%D0%BD%D0%B8%D1%8F%20%D1%81%D0%B5%D0%BC%D0%B5%D1%81%D1%82%D1%8A%D1%80%20%D0%BD%D0%B0%202016-2017%20%D1%83%D1%87.%20%D0%B3..pdf)\n03|[2017/2018 Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/03.%20%D0%98%D0%B7%D0%BF%D0%B8%D1%82%20%D0%BF%D1%80%D0%B5%D0%B7%20%D0%BB%D0%B5%D1%82%D0%BD%D0%B8%D1%8F%20%D1%81%D0%B5%D0%BC%D0%B5%D1%81%D1%82%D1%8A%D1%80%20%D0%BD%D0%B0%202017-2018%20%D1%83%D1%87.%20%D0%B3..pdf)\n04|[2020-07-13 Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/04.%20%D0%98%D0%B7%D0%BF%D0%B8%D1%82%D0%BD%D0%B0%20%D1%82%D0%B5%D0%BC%D0%B0%20%D0%BE%D1%82%2013%20%D1%8E%D0%BB%D0%B8%202020%20%D0%B3..pdf)\n05|[2020-08-17 Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/05.%20%D0%98%D0%B7%D0%BF%D0%B8%D1%82%D0%BD%D0%B0%20%D1%82%D0%B5%D0%BC%D0%B0%20%D0%BE%D1%82%2017%20%D0%B0%D0%B2%D0%B3%D1%83%D1%81%D1%82%202020%20%D0%B3..pdf)\n06|[2021-03-27 Control Test – Tasks](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/06.%20%D0%9A%D0%BE%D0%BD%D1%82%D1%80%D1%80%D0%BE%D0%BB%D0%BD%D0%BE%20%D0%BE%D1%82%2027%20%D0%BC%D0%B0%D1%80%D1%82%202021%20%D0%B3.%20%E2%80%93%20%D0%97%D0%B0%D0%B4%D0%B0%D1%87%D0%B8.pdf)\n07|[2021-03-27 Control Test – Solutions 1](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/07.%20%D0%9A%D0%BE%D0%BD%D1%82%D1%80%D1%80%D0%BE%D0%BB%D0%BD%D0%BE%20%D0%BE%D1%82%2027%20%D0%BC%D0%B0%D1%80%D1%82%202021%20%D0%B3.%20%E2%80%93%20%D0%A0%D0%B5%D1%88%D0%B5%D0%BD%D0%B8%D1%8F.pdf)\n08|[2021-03-27 Control Test – Solutions 2](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/08.%20%D0%9A%D0%BE%D0%BD%D1%82%D1%80%D1%80%D0%BE%D0%BB%D0%BD%D0%BE%20%D0%BE%D1%82%2027%20%D0%BC%D0%B0%D1%80%D1%82%202021%20%D0%B3.%20%E2%80%93%20%D0%BB%D0%B8%D1%87%D0%BD%D0%B8%20%D1%80%D0%B5%D1%88%D0%B5%D0%BD%D0%B8%D1%8F.pdf)\n09|[2021-05-27 Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/09.%20%D0%98%D0%B7%D0%BF%D0%B8%D1%82%D0%BD%D0%B0%20%D1%82%D0%B5%D0%BC%D0%B0%2027%20%D0%BC%D0%B0%D0%B8%CC%86%202021%20%D0%B3.pdf)\n10|[2021-08-27 Final Exam](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Control%20Tests%20and%20Exams/10.%20%D0%9F%D0%BE%D0%BF%D1%80%D0%B0%D0%B2%D0%B8%D1%82%D0%B5%D0%BB%D0%BD%D0%B0%20%D0%B8%D0%B7%D0%BF%D0%B8%D1%82%D0%BD%D0%B0%20%D1%82%D0%B5%D0%BC%D0%B0%20%D0%BF%D0%BE%20%D0%98%D0%9A%D0%93%D0%A2%2027%20%D0%B0%D0%B2%D0%B3%D1%83%D1%81%D1%82%202021.pdf)\n\n## Reports\n\nN|pdf\n:-:|:-\n01|[Брой Многочлени с P(2)=n](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/01.%20%D0%91%D1%80%D0%BE%D0%B8%CC%86%20%D0%9C%D0%BD%D0%BE%D0%B3%D0%BE%D1%87%D0%BB%D0%B5%D0%BD%D0%B8%20%D1%81%20P(2)%3Dn.pdf)\n02|[Асимптотика на p(n,k)](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/02.%20%D0%90%D1%81%D0%B8%D0%BC%D0%BF%D1%82%D0%BE%D1%82%D0%B8%D0%BA%D0%B0%20%D0%BD%D0%B0%20p(n%2Ck).pdf)\n03|[Вероятност две произволни естествени числа да са взаимнопрости](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/03.%20Coprime%20Natural%20Numbers%20Probability.pdf)\n04|[Числа на Лах](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/04.%20Lah%20Numbers.pdf)\n05|[Оцветяване на граф. Числа на Рамзи. Числа на Фолкман](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/05.%20Coloring%20Graph.%20Ramsey%20Numbers.%20Folkman%20Numbers.pdf)\n06|[Теорема на Хол. (2011-07-31) IMC, Blagoevgrad, Bulgaria](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/06.%20Hall%20Theorem%20(IMC%202011%2C%20Blagoevgrad%2C%20Bulgaria).pdf)\n07|[Теорема на Хол. Задача за разпределяне на предмети](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/07.%20Hall%20Theorem%20(Christmas%20Presents).pdf)\n08|[Задача от националната олимпиада на САШ 1986. Пораждащи функции](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/08.%20Partitions%20of%20Integers%20and%20Generating%20Functions%20%20(USAMO%201986).pdf)\n09|[Пораждащи функции на множества](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/09.%20Generating%20Functions%20of%20Sets.pdf)\n10|[ЗМС, 2008 – Зад. 10.3](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/10.%20%D0%97%D0%9C%D0%A1%2C%202008%20%E2%80%93%20%D0%97%D0%B0%D0%B4.%2010.3.pdf)\n11|[Стратегии. Затворници и кутии](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/11.%20Prisoners%20and%20Boxes.pdf)\n12|[Покритие с фигури. Куки. MOM 2004](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/12.%20Hooks%20(IMO%202004)%20C7%20EST.pdf)\n13|[Граф на Петерсен](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/13.%20Petersen%20Graph.pdf)\n14|[Неизоморфни графи с много сходства](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/14.%20Non-isomorphic%20Graphs%20with%20many%20similarities.pdf)\n15|[Фалшива монета](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/15.%20Fake%20Coin.pdf)\n16|[Задача за двуделен граф. 63-та НОМ, България](https://github.com/andy489/Selected_Chapters_from_Combinatorics_and_Graph_Theory/blob/main/Reports/16.%20%D0%97%D0%B0%D0%B4%D0%B0%D1%87%D0%B0%20%D0%B7%D0%B0%20%D0%B4%D0%B2%D1%83%D0%B4%D0%B5%D0%BB%D0%B5%D0%BD%20%D0%B3%D1%80%D0%B0%D1%84.pdf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandy489%2Fcombinatorics_and_graphs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandy489%2Fcombinatorics_and_graphs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandy489%2Fcombinatorics_and_graphs/lists"}