Lubos Thoma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2023

On powers of tight Hamilton cycles in randomly perturbed hypergraphsYulin Chang, Jie Han, Lubos Thoma. rsa, 63(3):591-609, October 2023. [doi]

An Algebraic Formulation of Hypergraph ColoringsMichael Krul, Lubos Thoma. combinatorics, 30(2), 2023. [doi]

2019

2-Colorability of r-Uniform HypergraphsMichael Krul, Lubos Thoma. combinatorics, 26(3):3, 2019. [doi]

2005

On Cover Graphs and Dependent Arcs in Acyclic OrientationsVojtech Rödl, Lubos Thoma. cpc, 14(4):585-617, 2005. [doi]

2004

Bipartite Subgraphs and Quasi-RandomnessJozef Skokan, Lubos Thoma. gc, 20(2):255-262, 2004. [doi]

2003

An Optimal Algorithm for Checking RegularityYoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma. SICOMP, 32(5):1210-1235, 2003. [doi]

2002

An optimal algorithm for checking regularity (extended abstract)Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma. soda 2002: 277-286 [doi]

2001

Vertex Covers by Edge Disjoint CliquesTom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. combinatorica, 21(2):171-197, 2001. [doi]

G-Intersecting FamiliesTom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. cpc, 10(5):367-384, 2001.

2000

Note on Sparse Random Graphs and Cover GraphsTom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. combinatorics, 7, 2000. [doi]

A Note on Random Minimum Length Spanning TreesAlan M. Frieze, Miklós Ruszinkó, Lubos Thoma. combinatorics, 7, 2000. [doi]

1999

On Perfect Matchings and Hamilton Cycles in Sums of Random TreesAlan M. Frieze, Michal Karonski, Lubos Thoma. siamdm, 12(2):208-216, 1999. [doi]

1997

Convergence of probabilities for the second order monadic properties of a random mappingTomasz Luczak, Lubos Thoma. rsa, 11(3):277-295, 1997.

On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-SystemsVojtech Rödl, Lubos Thoma. JCT, 80(1):166-173, 1997. [doi]

On the limit values of probabilities for the first order properties of graphsJoel Spencer, Lubos Thoma. dimacs 1999: 317-336

1996

Asymptotic packing and the random greedy algorithmVojtech Rödl, Lubos Thoma. rsa, 8(3):161-177, 1996.

Sign in or sign up to see more results.

runs on WebDSL