A note on Ramsey numbers, Journal of Combinatorial Theory, Series A, vol.29, issue.3, pp.354-360, 1980. ,
DOI : 10.1016/0097-3165(80)90030-8
Large induced degenerate subgraphs. Graphs and Combinatorics, pp.203-211, 1987. ,
Parallel search for maximal independence given minimal dependence, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '90Car79] Y. Caro. New results on the independence number, pp.212-21899, 1979. ,
On uncrowded hypergraphs, Random Structures & Algorithms, vol.2, issue.2-3, pp.209-212, 1995. ,
DOI : 10.1002/rsa.3240060208
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs, PP12] Marcin Pilipczuk and Micha l Pilipczuk. Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 Proceedings, chapter Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n, pp.1134-1147, 2012. ,
DOI : 10.1137/110839023
On the General Position Subset Selection Problem, SIAM Journal on Discrete Mathematics, vol.27, issue.4, pp.1727-1733, 2013. ,
DOI : 10.1137/120897493
A note on the independence number of triangle-free graphs, Discrete Mathematics J. B. Shearer. On the Independence Number of Sparse Graphs. Random Structures & Algorithms, vol.46, issue.73, pp.83-87269, 1983. ,
Tur??n's theorem for k-graphs, Discrete Mathematics, vol.2, issue.2, pp.183-186, 1972. ,
DOI : 10.1016/0012-365X(72)90084-2
Finding Large Independent Sets in Graphs and Hypergraphs, Tur41] P. Turán. On an extremal problem in graph theory [in Hungarian]. Math Fiz. Lapok, pp.488-500381, 1941. ,
DOI : 10.1137/S0895480102419731
A lower bound on the stability number of a simple graph, 1981. ,
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs, Discrete Applied Mathematics, vol.161, issue.16-17, pp.2716-2723, 1617. ,
DOI : 10.1016/j.dam.2013.04.012