SYSTEME DARC: RELATIONS ET HYPERSTRUCTURES PAR BLOCSDUBOIS JE; PICCHIOTTINO R; SICOURI G et al.1982; C. R. SEANCES ACAD. SCI., SER. 1, MATH.; ISSN 0249-6291; FRA; DA. 1982; VOL. 294; NO 7; PP. 251-256; ABS. ENG; BIBL. 13 REF.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

QUELQUES PROBLEMES CONCERNANT LES CLIQUES DES HYPERGRAPHES H-COMPLETS ET Q-PARTI H-COMPLETS.MEYER JC.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 127-139; BIBL. 5 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

SUR LES HYPERGRAPHES BICHROMATIQUES.LAS VERGNAS M.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 102-110; BIBL. 8 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

SUR UNE CONJECTURE DE V. CHVATAL.STERBOUL F.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 152-164; BIBL. 3 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

ON THE CHROMATIC NUMBER OF THE DIRECT PRODUCT OF HYPERGRAPHS.STERBOUL F.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 165-174; BIBL. 14 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

RECONSTRUCTION THEOREMS FOR INFINITE HYPERGRAPHS.RADO R.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 140-146; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

SUR LES HYPERGRAPHES INVARIANTS.DUCHET P.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 3; PP. 269-280; BIBL. 6 REF.Article

UNE CONDITION POUR QU'UN HYPERGRAPHE, OU SON COMPLEMENTAIRE, SOIT FORTEMENT ISOMORPHE A UN HYPERGRAPHE COMPLET.FOURNIER JC.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 95-98; BIBL. 3 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

ASYMPTOTICAL ESTIMATIONS FOR THE NUMBER OF CLIQUES OF UNIFORM HYPERGRAPHSTOMESCU I.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 345-358; BIBL. 3 REF.Conference Paper

NOTE ON ISOMORPHIC HYPERGRAPHS AND SOME EXTENSIONS OF WHITNEY'S THEOREM TO FAMILIES OF SETSBERGE C; RADO R.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 226-241; BIBL. 3 REF.Serial Issue

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

THEOREMS OF THE NORDHAUS-GADDUM TYPE FOR K-UNIFORM HYPERGRAPHSOLEJNIK F.1981; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1981; VOL. 31; NO 3; PP. 311-331; ABS. RUS; BIBL. 4 REF.Article

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

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