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

On-line algorithms for 2-coloring hypergraphs via chip gamesASLAM, J. A; DHAGAT, A.Theoretical computer science. 1993, Vol 112, Num 2, pp 355-369, issn 0304-3975Article

Load balancing in quorum systemsHOLZMAN, R; MARCUS, Y; PELEG, D et al.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 2, pp 223-245, issn 0895-4801Article

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

Efficient testing of hypergraphs: (Extended abstract)KOHAYAKAWA, Yoshiharu; NAGLE, Brendan; RÖDL, Vojtech et al.Lecture notes in computer science. 2002, pp 1017-1028, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricityGARRIDO, O; KELSEN, P; LINGAS, A et al.Information processing letters. 1996, Vol 58, Num 2, pp 55-58, issn 0020-0190Article

On decomposition of hypergraphs into △-systemsLONC, Z.Journal of combinatorial theory. Series A. 1989, Vol 52, Num 1, pp 158-162, issn 0097-3165Article

Economical tight examples for the biased Erdös-Selfridge theoremSUNDBERG, Eric.Discrete mathematics. 2008, Vol 308, Num 15, pp 3308-3314, issn 0012-365X, 7 p.Article

Generalization of solution concepts in conflict and negotiation analysisVAN GASTEL, M. A. J. J; PAELINCK, J. H. P.Theory and decision. 1992, Vol 32, Num 1, pp 65-76, issn 0040-5833Article

Maximal independent subsets in Steiner systems and in planar setsFÜREDI, Z.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 2, pp 196-199, issn 0895-4801Article

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

On geometric structure of global roundings for graphs and range spacesASANO, Tetsuo; KATOH, Naoki; TAMAKI, Hisao et al.Lecture notes in computer science. 2004, pp 455-467, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

A note on _j-perfect graphsBROWN, J. I; CORNEIL, D. G; MAHJOUB, A. R et al.Journal of graph theory. 1990, Vol 14, Num 3, pp 333-340, issn 0364-9024Article

Balanced extensions of graphs and hypergraphsRUCINSKI, A; VINCE, A.Combinatorica (Print). 1988, Vol 8, Num 3, pp 279-291, issn 0209-9683Article

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

Dissimilartés multivoies et généralisations d'hypergraphes sans triangles = Multiway dissimilarities and generalizations of hypergraphs with no trianglesDIATTA, J.Mathématiques, informatique et sciences humaines. 1997, Num 138, pp 57-73, issn 0995-2314Article

Lower bounds for hypergraph Ramsey numbersABBOTT, H. L; SMUGA-OTTO, M. J.Discrete applied mathematics. 1995, Vol 61, Num 2, pp 177-180, issn 0166-218XArticle

The Erdos-Faber-Lovasz conjecture for dense hypergraphsSANCHEZ-ARROYO, Abdon.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 991-992, issn 0012-365X, 2 p.Conference Paper

New graph representation for the recognition of occluded objectsHAMDANI, H; SALOTTI, M.SPIE proceedings series. 1998, pp 84-91, isbn 0-8194-3112-5Conference Paper

Etude de Structures Ternaires Non-Reconstructibles = Study of Non-Reconstructible Ternary StructuresConilh, Stéphanie; Lopez, G.1996, 131 p.Thesis

Etude de certains réseaux d'interconnexion: structure et communications = Some interconnection networks: structure and communicationDjelloul, Selma; Sotteau, Dominique.1993, 168 p.Thesis

Homology of the line graph and of related graph-valued functionsPRISNER, E.Archiv der Mathematik. 1991, Vol 56, Num 4, pp 400-404, issn 0003-889X, 5 p.Article

On the P₄-structure of perfect graphs. IV: Partner graphsHAYWARD, R. B; LENHART, W. J.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 1, pp 135-139, issn 0095-8956Article

Exact solution of some Turán-type problemsFRANKL, P.Journal of combinatorial theory. Series A. 1987, Vol 45, Num 2, pp 226-262, issn 0097-3165Article

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