- An approximate Dirac-type theorem for k-uniform hypergraphs
- TEORIA GRAFOW WIOSNA 2006
- Random hypergraph processes with degree restrictions
- Planar Ramsey Numbers for Small Graphs Andrzej Dudek
- RAMSEY GAMES AGAINST A ONE-ARMED BANDIT EHUD FRIEDGUT, YOSHIHARU KOHAYAKAWA, VOJTECH RODL,
- UNIVERSALITY AND TOLERANCE (Extended Abstract)
- www.ii.uj.edu.pl/preMD/ Agnieszka GORLICH and Andrzej ZAK
- Perfect matchings in uniform hypergraphs with large minimum degree.
- The Infamous Upper Tail Svante Janson,1
- Evolution of a random graph from a triangle perspective
- Connectedness of the degree bounded star process Catherine Greenhill
- The Generalization of Dirac's Theorem for Hypergraphs
- SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics Vol. 21, No. 2, pp. 442460
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- The Ramsey number for 3-uniform tight hypergraph cycles
- UNCORRECTED DISC: 7906 Model 3G pp. 17 (col. fig: nil)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs
- Author Query Form Article ID
- UNIVERSALITY OF RANDOM GRAPHS DOMINGOS DELLAMONICA JR.1
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 1
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 4
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 6
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 7
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 10
- Comment.Math.Univ.Carolin. 49,4 (2008)633--636 633 A note on perfect matchings in uniform
- X1, X2, ..., Xn Xr = pr S = n
- ARTICLE IN PRESS YJCTA:3949 Please cite this article in press as: V. Rdl et al., Perfect matchings in large uniform hypergraphs with large minimum
- A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge
- TEORIA GRAFOW 2 (TGR 430) WIOSNA 2006 Wykladowca : prof. dr hab. Andrzej Rucinski
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 2
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 8
- THE DELETION METHOD FOR UPPER TAIL ESTIMATES SVANTE JANSON AND ANDRZEJ RUCINSKI
- BOLYAI SOCIETY An Irregular Mind MATHEMATICAL STUDIES, 21 (Szemeredi is 70)
- Date of delivery: Journal and vol/article ref: CPC 99065
- July 29, 2010 9:55 WSPC/INSTRUCTION FILE hm-ijfcsfinal International Journal of Foundations of Computer Science
- SHORT PATHS IN QUASI-RANDOM TRIPLE SYSTEMS WITH SPARSE UNDERLYING GRAPHS
- Rachunek Prawdopodobiestwa 2 Zestaw zada nr 3
- J Comb Optim DOI 10.1007/s10878-008-9174-9
- Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dudek
- An improved upper bound on the density of universal random graphs
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- AN IMPROVED UPPER BOUND ON THE DENSITY OF UNIVERSAL RANDOM GRAPHS
- An Improved Upper Bound on the Density of Universal Random Graphs
