#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1996

2007

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yoshiharu Kohayakawa, Vojtech RÃ¶dl, Lubos Thoma
- SIAM J. Comput.
- 2003

We present a deterministic algorithm A that, in O(m2) time, verifies whether a given m by m bipartite graph G is regular, in the sense of SzemerÃ©di [E. SzemerÃ©di, Regular partitions of graphs,â€¦ (More)

- Vojtech RÃ¶dl, Lubos Thoma
- Random Struct. Algorithms
- 1996

- 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)

- Anita Varga, Lubos Thoma, Johan Bruinsma
- Plant Cell, Tissue and Organ Culture
- 2004

A main problem in the vegetative propagation of ornamental plants in vitro is the epigenetic instability of cells removed from their organized environment. With calluses of leaf explants of Kalanchoeâ€¦ (More)

- Joel H. Spencer, Lubos Thoma
- Contemporary Trends in Discrete Mathematics
- 1997

Consider the random graph G(n; p); where p = p(n) is any threshold function satisfying p(n) = (ln n=n): We give a full characterization of the limit values of probabilities of G(n; p) having aâ€¦ (More)

A graph G is a Unit Disk (UD) graph if there is an assignment of unit disks centered at its vertices such that there is an edge in G iff the corresponding unit disks intersect. The square G of G isâ€¦ (More)

- Vojtech RÃ¶dl, Lubos Thoma
- J. Comb. Theory, Ser. A
- 1997

Let r 3 be an integer. A weak (r, 2)-system is a family of r sets such that all pairwise intersections among the members have the same cardinality. We show that for n large enough, there exists aâ€¦ (More)

- Alan M. Frieze, Michal Karonski, Lubos Thoma
- SIAM J. Discrete Math.
- 1999

We prove that the sum of two random trees possesses with high probability a perfect matching and the sum of five random trees possesses with high probability a Hamilton cycle. AMS Subjectâ€¦ (More)

- Alan M. Frieze, MiklÃ³s RuszinkÃ³, Lubos Thoma
- Electr. J. Comb.
- 2000

Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning tree. We show inâ€¦ (More)

- Tom Bohman, Alan M. Frieze, MiklÃ³s RuszinkÃ³, Lubos Thoma
- Combinatorics, Probability & Computing
- 2001

Let G be a graph on vertex set [n], and for X [n] let N(X) be the union of X and it's neighborhood in G. A family of sets F 2 is G-intersecting if N(X) \ Y 6= ; for all X;Y 2 F . In this paper weâ€¦ (More)