The generalization of Dirac's theorem for hypergraphsSZEMEREDI, Endre; RUCINSKI, Andrzej; RÖDL, Vojtech et al.Lecture notes in computer science. 2005, pp 52-56, issn 0302-9743, isbn 3-540-28702-7, 5 p.Conference Paper

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

STABLE KNESER HYPERGRAPHS AND IDEALS IN N WITH THE NIKODYM PROPERTYALON, Noga; DREWNOWSKI, Lech; LUCZAK, Tomasz et al.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 2, pp 467-471, issn 0002-9939, 5 p.Article

A note on the Erdõs-Farber-Lovász conjectureJACKSON, Bill; SETHURAMAN, G; WHITEHEAD, Carol et al.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 911-915, issn 0012-365X, 5 p.Conference Paper

Experimental Evaluation of the Algorithms for Recognizing Fibonacci CubesPESEK, Igor; TARANENKO, Andrej; VESEL, Aleksander et al.Information technology interfaces. 2005, pp 663-668, isbn 953-7138-02-X, 1Vol, 6 p.Conference Paper

Solution of two fractional packing problems of LovászSCHRIJVER, A; SEYMOUR, P. D.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 973-978, issn 0012-365X, 6 p.Article

Hypergraph decomposition and secret sharingDI CRESCENZO, Giovanni; GALDI, Clemente.Lecture notes in computer science. 2003, pp 645-654, issn 0302-9743, isbn 3-540-20695-7, 10 p.Conference Paper

On the 2-colorability of random hypergraphsACHLIOPTAS, Dimitris; MOORE, Cristopher.Lecture notes in computer science. 2002, pp 78-90, issn 0302-9743, isbn 3-540-44147-6, 13 p.Conference Paper

Small transversals in hypergraphsCHVATAL, V; MCDIARMID, C.Combinatorica (Print). 1992, Vol 12, Num 1, pp 19-26, issn 0209-9683Article

Normal functionals and spaces of weightsHAGLER, J; SCHINDLER, C.International journal of theoretical physics. 1991, Vol 30, Num 10, pp 1337-1342, issn 0020-7748Article

Appendix : On edge-isoperimetric theorems for uniform hypergraphsAHLSWEDE, R; CAI, N.General theory of information transfer and combinatorics. Lecture notes in computer science. sd, pp 979-1005, issn 0302-9743, isbn 3-540-46244-9, 1Vol, 27 p.Book Chapter

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

An algorithm for heilbronn's problemBERTRAM-KRETZBERG, C; HOFMEISTER, T; LEFMANN, H et al.Lecture notes in computer science. 1997, pp 23-31, issn 0302-9743, isbn 3-540-63357-XConference Paper

Page / 43