#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2017

- This year (0)
- Last 5 years (9)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Vojtech RÃ¶dl, Jozef Skokan
- Random Struct. Algorithms
- 2004

SzemerÃ©diâ€™s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi-randomness, Randomâ€¦ (More)

- Vojtech RÃ¶dl, Jozef Skokan
- Random Struct. Algorithms
- 2006

In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we give hereâ€¦ (More)

- Peter Allen, Graham R. Brightwell, Jozef Skokan
- Combinatorica
- 2013

A celebrated result of ChvÃ¡tal, RÃ¶dl, SzemerÃ©di and Trotter states (in slightly weakened form) that, for every natural number Î”, there is a constant rÎ” such that, for any connected n-vertex graph Gâ€¦ (More)

- Yoshiharu Kohayakawa, Vojtech RÃ¶dl, Jozef Skokan
- J. Comb. Theory, Ser. A
- 2002

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Grahamâ€¦ (More)

- Jozef Skokan, Lubos Thoma
- Graphs and Combinatorics
- 2004

We say that a family of graphs G = {Gn : n â‰¥ 1} is p-quasi-random, 0 < p < 1, if it shares typical properties of the random graph G(n, p); for a definition, see below. We denote by Q(p) the class ofâ€¦ (More)

- Fabricio Siqueira Benevides, Tomasz Luczak, Alex D. Scott, Jozef Skokan, M. White
- Combinatorics, Probability & Computing
- 2012

Li, Nikiforov and Schelp [12] conjectured that any 2-edge coloured graph G with order n and minimum degree Î´(G) > 3n/4 contains a monochromatic cycle of length `, for all ` âˆˆ [4, dn/2e]. We proveâ€¦ (More)

- Vojtech RÃ¶dl, Brendan Nagle, Jozef Skokan, Mathias Schacht, Yoshiharu Kohayakawa
- Proceedings of the National Academy of Sciencesâ€¦
- 2005

Szemeredi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a givenâ€¦ (More)

- T.L. Mifflin, Chris Boner, G. H. Godfrey, Jozef Skokan
- 2004 IEEE Aerospace Conference Proceedings (IEEEâ€¦
- 2004

We present a simple model for transactional evidence of terrorist activities that occur in the midst of massive amounts of "transactional noise". The theory is based on random graphs. We consider twoâ€¦ (More)

- Yuejian Peng, Vojtech RÃ¶dl, Jozef Skokan
- Combinatorics, Probability & Computing
- 2005

Many applications of SzemerÃ©diâ€™s Regularity Lemma for graphs are based on the following counting result. If G is an s-partite graph with partition V (G) = â‹ƒs i=1 Vi, |Vi| = m for all i âˆˆ [s], and allâ€¦ (More)

- Fabricio Siqueira Benevides, Jozef Skokan
- J. Comb. Theory, Ser. B
- 2009

Denote by R(L,L,L) the minimum integer N such that any 3-coloring of the edges of the complete graph with N vertices KN contains a monochromatic copy of a graph L. Bondy and ErdÅ‘s [1] conjecturedâ€¦ (More)