Lubos Thoma

According to our database, Lubos Thoma authored at least 16 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On powers of tight Hamilton cycles in randomly perturbed hypergraphs.

Yulin Chang, Jie Han, Lubos Thoma

Random Struct. Algorithms, October, 2023

An Algebraic Formulation of Hypergraph Colorings.

Michael Krul, Lubos Thoma

Electron. J. Comb., 2023

2019

2-Colorability of r-Uniform Hypergraphs.

Michael Krul, Lubos Thoma

Electron. J. Comb., 2019

2005

On Cover Graphs and Dependent Arcs in Acyclic Orientations.

Vojtech Rödl, Lubos Thoma

Comb. Probab. Comput., 2005

2004

Bipartite Subgraphs and Quasi-Randomness.

Jozef Skokan, Lubos Thoma

Graphs Comb., 2004

2003

An Optimal Algorithm for Checking Regularity.

Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma

SIAM J. Comput., 2003

2002

An optimal algorithm for checking regularity (extended abstract).

Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

G-Intersecting Families.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Comb. Probab. Comput., 2001

Vertex Covers by Edge Disjoint Cliques.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Comb., 2001

2000

A Note on Random Minimum Length Spanning Trees.

Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Electron. J. Comb., 2000

Note on Sparse Random Graphs and Cover Graphs.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Electron. J. Comb., 2000

1999

On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.

Alan M. Frieze, Michal Karonski, Lubos Thoma

SIAM J. Discret. Math., 1999

1997

Convergence of probabilities for the second order monadic properties of a random mapping.

Tomasz Luczak, Lubos Thoma

Random Struct. Algorithms, 1997

On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.

Vojtech Rödl, Lubos Thoma

J. Comb. Theory, Ser. A, 1997

On the limit values of probabilities for the first order properties of graphs.

Joel Spencer, Lubos Thoma

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Asymptotic packing and the random greedy algorithm.

Vojtech Rödl, Lubos Thoma

Random Struct. Algorithms, 1996