Decomposable graphs and hypergraphsLAURITZEN, S. L; SPEED, T. P; VIJAYAN, K et al.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1984, Vol 36, Num 1, pp 12-29, issn 0334-3316Article

A class of bichromatic hypergraphsFOURNIER, J.-C; VERGNAS, M. L.North-Holland mathematics studies. 1984, Vol 88, pp 21-27, issn 0304-0208Article

HEREDITARY DISCREPANCIES IN DIFFERENT NUMBERS OF COLORS IIDOERR, Benjamin; FOUZ, Mahmoud.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1205-1213, issn 0895-4801, 9 p.Article

Recognising k-connected hypergraphs in cubic timeDREWES, F.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 83-122, issn 0304-3975Conference Paper

Ramsey-type theoremsERDOS, P; HAJNAL, A.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 37-52, issn 0166-218X, 16 p.Article

Normal hypergraphs and the weak perfect graph conjectureLOVASZ, L.North-Holland mathematics studies. 1984, Vol 88, pp 29-42, issn 0304-0208Article

Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article

SUR LA CARDINALITE MAXIMUM DES COUPLAGES D'HYPERGRAPHES ALEATOIRES UNIFORMESFERNANDEZ DE LA VEGA W.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 2-3; PP. 315-318; BIBL. 2 REF.Article

PARTITIVE HYPERGRAPHSCHEIN M; HABIB M; MAURER MC et al.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 1; PP. 35-50; BIBL. 20 REF.Article

A characterization of hypercactiSONNTAG, Martin.Discrete mathematics. 2007, Vol 307, Num 21, pp 2615-2621, issn 0012-365X, 7 p.Article

On chromaticity of hypergraphsBOROWIECKI, Mieczyslaw; LAZUKA, Ewa.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1418-1429, issn 0012-365X, 12 p.Conference Paper

Loose Hamilton cycles in hypergraphsKEEVASH, Peter; KÜHN, Daniela; MYCROFT, Richard et al.Discrete mathematics. 2011, Vol 311, Num 7, pp 544-559, issn 0012-365X, 16 p.Article

A new algorithm for the hypergraph transversal problemKHACHIYAN, Leonid; BOROS, Endre; ELBASSIONI, Khaled et al.Lecture notes in computer science. 2005, pp 767-776, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

A note on the hypergraph functorHÖHLE, Ulrich.Fuzzy sets and systems. 2002, Vol 131, Num 3, pp 353-356, issn 0165-0114Article

A general framework for discovering and proving theorems of the Erdös-Ko-Rado typeSCHMERL, J. H.Journal of combinatorial theory. Series A. 1992, Vol 61, Num 2, pp 252-262, issn 0097-3165Article

Improved bounds and schemes for the declustering problemDOERR, Benjamin; HEBBINGHAUS, Nils; WERTH, Sören et al.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 123-132, issn 0304-3975, 10 p.Article

Balanced matricesCONFORTI, Michele; CORNUEJOLS, Gérard; VUSKOVIE, Kristina et al.Discrete mathematics. 2006, Vol 306, Num 19-20, pp 2411-2437, issn 0012-365X, 27 p.Article

On the chromaticity of sunflower hypergraphs SH(n, p, h)TOMESCU, Ioan.Discrete mathematics. 2007, Vol 307, Num 6, pp 781-786, issn 0012-365X, 6 p.Article

Good and nice colorings of balanced hypergraphsDE WERRA, D.Discrete mathematics. 2006, Vol 306, Num 19-20, pp 2630-2636, issn 0012-365X, 7 p.Article

On hypergraphs without two edges intersecting in a given number of verticesFRANKL, P; FÜREDI, Z.Journal of combinatorial theory. Series A. 1984, Vol 36, Num 2, pp 230-236, issn 0097-3165Article

Graphs whose neighborhoods have no special cyclesBROUWER, A. E; DUCHET, P; SCHRIJVER, A et al.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 177-182, issn 0012-365XArticle

Hypergraphia in epilepsy: is there a specificity to temporal lobe epilepsy?HERMANN, B. P; WHITMAN, S; ARNTSON, P et al.Journal of neurology, neurosurgery and psychiatry. 1983, Vol 46, Num 9, pp 848-853, issn 0022-3050Article

On Chooser-Picker positional gamesCSERNENSZKY, Andras; IVETT MANDITY, C; PLUHAR, Andras et al.Discrete mathematics. 2009, Vol 309, Num 16, pp 5141-5146, issn 0012-365X, 6 p.Article

On a Turán-type hypergraph problem of Brown, Erdös and T. sósSARKÖZY, Gabor N; SELKOW, Stanley.Discrete mathematics. 2005, Vol 297, Num 1-3, pp 190-195, issn 0012-365X, 6 p.Article

Quelques problèmes concernant les hypergraphes autotransversaux. Généralisation des treillis continus = Some problems about selfblocking hypergraphs. Generalization of continuous latticesFlandre, Olivier; Fougeres, Alain.1992, 138 p.Thesis