Author:
Chudnovsky Maria,Safra Shmuel
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Ramsey-type theorems with forbidden subgraphs, Paul Erdős and his mathematics;Alon;Combinatorica,2001
2. M. Chudnovsky, The structure of bull-free graphs, in preparation
3. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006
4. Combinatorial Optimization;Cook,1998
5. Ramsey-type theorems;Erdős;Discrete Appl. Math.,1989
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards the Erdős-Hajnal conjecture for $$P_5$$-free graphs;Research in the Mathematical Sciences;2023-12-19
2. The regularity of almost all edge ideals;Advances in Mathematics;2023-12
3. References;Graphs, Orders, Infinites and Philosophy;2023-03-31
4. Erdős–Hajnal for graphs with no 5‐hole;Proceedings of the London Mathematical Society;2023-01-31
5. Introducing lop-Kernels: A Framework for Kernelization Lower Bounds;Algorithmica;2022-06-03