K. Dutta, D. Mubayi, and C. R. Subramanian, New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs, SIAM Journal on Discrete Mathematics, vol.26, issue.3, pp.1134-1147, 2012.
DOI : 10.1137/110839023

M. Ajtai, J. Komlós, and E. Szemerédi, 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
URL : https://doi.org/10.1016/0097-3165(80)90030-8

J. Noga-alon, P. D. Kahn, and . Seymour, Large induced degenerate subgraphs, Graphs and Combinatorics, vol.48, issue.1, pp.203-211, 1987.
DOI : 10.1007/BF01788542

K. Pankaj, J. Agarwal, M. Matou?ek, and . Sharir, On Range Searching with Semialgebraic Sets, II. SIAM Journal on Computing, vol.42, issue.6, pp.2039-2062, 2013.

N. Alon and J. H. Spencer, The Probabilistic Method, 2008.
DOI : 10.1002/0471722154

O. Mark-de-berg, M. Cheong, M. Van-kreveld, and . Overmars, Computational Geometry: Algorithms and Applications, 2008.

J. Boissonnat, R. Dyer, and A. Ghosh, THE STABILITY OF DELAUNAY TRIANGULATIONS, International Journal of Computational Geometry & Applications, vol.27, issue.5, pp.303-334, 2013.
DOI : 10.1007/s10711-008-9261-1
URL : https://hal.archives-ouvertes.fr/hal-00807050

P. Beame and M. Luby, Parallel Search for Maximal Independence Given Minimal Dependence, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.212-218, 1990.

Y. Caro, New results on the independence number, 1979.

Y. Caro and Z. Tuza, Improved lower bounds onk-independence, Journal of Graph Theory, vol.48, issue.1, pp.99-107, 1991.
DOI : 10.1002/jgt.3190150110

J. Cardinal, C. D. Tóth, and D. R. Wood, General position subsets and independent hyperplanes in d-space, Journal of Geometry, vol.3, issue.3, pp.1-11, 2016.
DOI : 10.1007/BF02579194
URL : http://users.monash.edu.au/%7Edavidwo/papers/CTW.pdf

R. A. Duke, H. Lefmann, and V. Rödl, On uncrowded hypergraphs, Random Structures & Algorithms, vol.2, issue.2-3, pp.209-212, 1995.
DOI : 10.1007/978-3-642-72905-8_18

H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990.
DOI : 10.1145/77635.77639

J. Erickson and R. Seidel, Better lower bounds on detecting affine and spherical degeneracies, Discrete & Computational Geometry, vol.19, issue.2, pp.41-57, 1995.
DOI : 10.1016/0196-6774(82)90002-5

J. Erickson and R. Seidel, Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies, Discrete & Computational Geometry, vol.18, issue.2, pp.239-240, 1997.
DOI : 10.1109/sfcs.1993.366834

G. Elekes and C. D. Tóth, Incidences of Not-Too-Degenerate Hyperplanes [PP12] Marcin Pilipczuk and Michal Pilipczuk. Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n, Proceedings of the 21st Annual ACM Symposium on Computational Geometry Proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, pp.16-21, 2005.

S. Michael, D. R. Payne, and . Wood, On the General Position Subset Selection Problem, SIAM Journal on Discrete Mathematics, vol.27, issue.4, pp.1727-1733, 2013.

J. B. Shearer, A note on the independence number of triangle-free graphs, Discrete Mathematics, vol.46, issue.1, pp.83-87, 1983.
DOI : 10.1016/0012-365X(83)90273-X

J. B. Shearer, On the independence number of sparse graphs, Random Structures & Algorithms, vol.1, issue.3, pp.269-272, 1995.
DOI : 10.1002/rsa.3240070305

J. H. Spencer-hadas, A. Shachnai, and . Srinivasan, Turán's theorem for k-graphs Finding Large Independent Sets in Graphs and Hypergraphs, Discrete Mathematics SIAM Journal on Discrete Mathematics, vol.2, issue.183, pp.183-186488, 1972.

E. Szemerédi and W. T. Trotter, Extremal problems in discrete geometry A Lower Bound on the Independence Number of Arbitrary Hypergraphs, Combinatorica Journal of Graph Theory, vol.3, issue.303, pp.381-392213, 1983.

P. Turánwei81 and ]. V. Wei, On an extremal problem in graph theory A lower bound on the stability number of a simple graph [Zak13] Manouchehr Zaker. Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs, Math Fiz. Lapok, pp.16116-172716, 1941.