G. Agnarsson and M. M. Halldórsson, Strong Colorings of Hypergraphs, Lecture Notes in Computer Science, vol.3351, pp.253-266, 2004.
DOI : 10.1007/978-3-540-31833-0_21

F. Bernstein, Zur theorie der trigonometrische reihen, Leipz. Ber, vol.60, pp.325-328, 1908.

B. Bollobás, Extremal Graph Theory, 1978.
DOI : 10.1201/b16132-57

H. Chen and A. Frieze, Coloring bipartite hypergraphs, Integer Programming and Combinatorial Optimization, pp.345-358, 1996.
DOI : 10.1007/3-540-61310-2_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.3498

D. De-caen and Z. Füredi, The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane, Journal of Combinatorial Theory, Series B, vol.78, issue.2, pp.274-276, 2000.
DOI : 10.1006/jctb.1999.1938

I. Dinur, O. Regev, and C. Smyth, The Hardness of 3-Uniform Hypergraph Coloring, Combinatorica, vol.25, issue.5, pp.519-535, 2005.
DOI : 10.1007/s00493-005-0032-4

K. Edwards, The complexity of colouring problems on dense graphs, Theoretical Computer Science, vol.43, issue.C, pp.337-343, 1986.
DOI : 10.1016/0304-3975(86)90184-2

P. Erdós and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica, vol.16, issue.3, pp.181-192, 1983.
DOI : 10.1007/BF02579292

S. Even, A. Itai, and A. Shamir, On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing, vol.5, issue.4, pp.691-703, 1976.
DOI : 10.1137/0205048

A. W. Goodman, On Sets of Acquaintances and Strangers at any Party, The American Mathematical Monthly, vol.66, issue.9, pp.778-783, 1959.
DOI : 10.2307/2310464

V. Guruswami, J. Hastad, and M. Sudan, Hardness of Approximate Hypergraph Coloring, SIAM Journal on Computing, vol.31, issue.6, pp.1663-1686, 2002.
DOI : 10.1137/S0097539700377165

M. Karpi´nskikarpi´nski, A. Ruci´nskiruci´nski, and E. Szyma´nskaszyma´nska, The Complexity of Perfect Matching Problems on Dense Hypergraphs, Algorithms and Computation, pp.626-636, 2009.
DOI : 10.1007/978-3-642-10631-6_64

M. Karpi´nskikarpi´nski, A. Ruci´nskiruci´nski, and E. Szyma´nskaszyma´nska, Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs, Theoretical Informatics Lecture Notes in Computer Science, vol.6034, pp.662-673, 2010.
DOI : 10.1007/978-3-642-12200-2_57

M. Karpi´nskikarpi´nski, A. Ruci´nskiruci´nski, and E. Szyma´nskaszyma´nska, COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY, International Journal of Foundations of Computer Science, vol.21, issue.06, pp.905-924, 2010.
DOI : 10.1142/S0129054110007635

P. Keevash, Hypergraph Tur??n problems, pp.83-140, 2011.
DOI : 10.1017/CBO9781139004114.004

P. Keevash and B. Sudakov, The Tur??n Number Of The Fano Plane, Combinatorica, vol.25, issue.5, pp.561-574, 2005.
DOI : 10.1007/s00493-005-0034-2

M. Krivelevich, R. Nathaniel, and B. Sudakov, Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs, Journal of Algorithms, vol.41, issue.1, pp.99-113, 2001.
DOI : 10.1006/jagm.2001.1173

L. Lovász, Coverings and colorings of hypergraphs, Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp.3-12, 1973.

Y. Person and M. Schacht, An expected polynomial time algorithm for coloring 2-colorable 3-graphs, Electronic Notes in Discrete Mathematics, vol.34, issue.2, pp.1-18, 2011.
DOI : 10.1016/j.endm.2009.07.077
URL : https://hal.archives-ouvertes.fr/hal-00990504

O. Pikhurko, Perfect Matchings and K 4 3 -Tilings in Hypergraphs of Large Codegree, Graphs and Combinatorics, vol.24, issue.4, pp.391-404, 2008.
DOI : 10.1007/s00373-008-0787-7

J. Radhakrishnan and A. Srinivasan, Improved bounds and algorithms for hypergraph 2-coloring. Random Structures & Algorithms, pp.4-32, 2000.

A. Razborov, On the Minimal Density of Triangles in Graphs, Combinatorics, Probability and Computing, vol.15, issue.04, pp.603-618, 2008.
DOI : 10.2307/2310464

V. Rödl, A. Ruci´nskiruci´nski, and E. Szemerédi, A Dirac-Type Theorem for 3-Uniform Hypergraphs, Combinatorics, Probability and Computing, vol.15, issue.1-2, pp.229-251, 2006.
DOI : 10.1017/S0963548305007042

V. Rödl, A. Ruci´nskiruci´nski, and E. Szemerédi, Perfect matchings in large uniform hypergraphs with large minimum collective degree, Journal of Combinatorial Theory, Series A, vol.116, issue.3, pp.613-636, 2009.
DOI : 10.1016/j.jcta.2008.10.002

E. Szyma´nskaszyma´nska, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, Graph Theoretic Concepts in Computer Science, pp.304-314, 2010.
DOI : 10.1007/978-3-642-10217-2_43

E. Szyma´nskaszyma´nska, The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree, European Journal of Combinatorics, vol.34, issue.3, pp.632-646, 2013.
DOI : 10.1016/j.ejc.2011.12.009