Works matching AU Bohman, Tom

Results: 30

The early evolution of the H-free process.

Published in:

Inventiones Mathematicae, 2010, v. 181, n. 2, p. 291, doi. 10.1007/s00222-010-0247-x

By:

Bohman, Tom;
Keevash, Peter

Publication type:

Article

A greedy algorithm for finding a large 2‐matching on a random cubic graph.

Published in:

Journal of Graph Theory, 2018, v. 88, n. 3, p. 449, doi. 10.1002/jgt.22224

By:

Bal, Deepak;
Bennett, Patrick;
Bohman, Tom;
Frieze, Alan

Publication type:

Article

Karp–Sipser on Random Graphs with a Fixed Degree Sequence.

Published in:

Combinatorics, Probability & Computing, 2011, v. 20, n. 5, p. 721, doi. 10.1017/S0963548311000265

By:

BOHMAN, TOM;
FRIEZE, ALAN

Publication type:

Article

Erdős-Ko-Rado in Random Hypergraphs.

Published in:

Combinatorics, Probability & Computing, 2009, v. 18, n. 5, p. 629, doi. 10.1017/S0963548309990253

By:

Balogh, József;
Bohman, Tom;
Mubayi, Dhruv

Publication type:

Article

First-Order Definability of Trees and Sparse Random Graphs.

Published in:

Combinatorics, Probability & Computing, 2007, v. 16, n. 3, p. 375, doi. 10.1017/S0963548306008376

By:

BOHMAN, TOM;
FRIEZE, ALAN;
ŁUCZAK, TOMASZ;
PIKHURKO, OLEG;
SMYTH, CLIFFORD;
SPENCER, JOEL;
VERBITSKY, OLEG

Publication type:

Article

Creating a Giant ComponentResults similar to Theorems 1.5 and 1.6 were obtained independently by Flaxman, Gamarnik and Sorkin [10].

Published in:

Combinatorics, Probability & Computing, 2006, v. 15, n. 4, p. 489, doi. 10.1017/s0963548306007486

By:

TOM BOHMAN;
DAVID KRAVITZ

Publication type:

Article

A natural barrier in random greedy hypergraph matching.

Published in:

Combinatorics, Probability & Computing, 2019, v. 28, n. 6, p. 816, doi. 10.1017/S0963548319000051

By:

Bennett, Patrick;
Bohman, Tom

Publication type:

Article

A Multivariate Test of an Expanded Andersen Health Care Utilization Model for Complementary and Alternative Medicine (CAM) Use in African Americans.

Published in:

Journal of Alternative & Complementary Medicine, 2009, v. 15, n. 8, p. 911, doi. 10.1089/acm.2008.0561

By:

Brown, Carolyn;
Barner, Jamie;
Bohman, Tom;
Richards, Kristin

Publication type:

Article

On the irregularity strength of trees.

Published in:

Journal of Graph Theory, 2004, v. 45, n. 4, p. 241

By:

Tom Bohman;
David Kravitz

Publication type:

Article

On a list coloring conjecture of Reed.

Published in:

Journal of Graph Theory, 2002, v. 41, n. 2, p. 106, doi. 10.1002/jgt.10054

By:

Bohman, Tom;
Holzman, Ron

Publication type:

Article

SIR epidemics on random graphs with a fixed degree sequence.

Published in:

Random Structures & Algorithms, 2012, v. 41, n. 2, p. 179, doi. 10.1002/rsa.20401

By:

Bohman, Tom;
Picollelli, Michael

Publication type:

Article

Ramsey games with giants.

Published in:

Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 1, doi. 10.1002/rsa.20343

By:

Bohman, Tom;
Frieze, Alan;
Krivelevich, Michael;
Loh, Po-Shen;
Sudakov, Benny

Publication type:

Article

Coloring H-free hypergraphs.

Published in:

Random Structures & Algorithms, 2010, v. 36, n. 1, p. 11, doi. 10.1002/rsa.20298

By:

Bohman, Tom;
Frieze, Alan;
Mubayi, Dhruv

Publication type:

Article

Hamilton cycles in 3-out.

Published in:

Random Structures & Algorithms, 2009, v. 35, n. 4, p. 393, doi. 10.1002/rsa.20272

By:

Bohman, Tom;
Frieze, Alan

Publication type:

Article

The game chromatic number of random graphs.

Published in:

Random Structures & Algorithms, 2008, v. 32, n. 2, p. 223, doi. 10.1002/rsa.20179

By:

Bohman, Tom;
Frieze, Alan;
Sudakov, Benny

Publication type:

Article

Randomly generated intersecting hypergraphs II.

Published in:

Random Structures & Algorithms, 2007, v. 30, n. 1/2, p. 17, doi. 10.1002/rsa.20152

By:

Bohman, Tom;
Frieze, Alan;
Martin, Ryan;
Ruszinkó, Miklós;
Smyth, Cliff

Publication type:

Article

A phase transition for avoiding a giant component.

Published in:

Random Structures & Algorithms, 2006, v. 28, n. 2, p. 195, doi. 10.1002/rsa.20085

By:

Bohman, Tom;
Kim, Jeong Han

Publication type:

Article

Avoidance of a giant component in half the edge set of a random graph.

Published in:

Random Structures & Algorithms, 2004, v. 25, n. 4, p. 432, doi. 10.1002/rsa.20038

By:

Bohman, Tom;
Frieze, Alan;
Wormald, Nicholas C.

Publication type:

Article

Adding random edges to dense graphs.

Published in:

Random Structures & Algorithms, 2004, v. 24, n. 2, p. 105, doi. 10.1002/rsa.10112

By:

Bohman, Tom;
Frieze, Alan;
Krivelevich, Michael;
Martin, Ryan

Publication type:

Article

How many random edges make a dense graph hamiltonian?

Published in:

Random Structures & Algorithms, 2003, v. 22, n. 1, p. 33, doi. 10.1002/rsa.10070

By:

Bohman, Tom;
Frieze, Alan;
Martin, Ryan

Publication type:

Article

Addendum to 'avoiding a giant component'.

Published in:

Random Structures & Algorithms, 2002, v. 20, n. 1, p. 126, doi. 10.1002/rsa.10018

By:

Bohman, Tom;
Frieze, Alan

Publication type:

Article

Avoiding a giant component.

Published in:

Random Structures & Algorithms, 2001, v. 19, n. 1, p. 75, doi. 10.1002/rsa.1019

By:

Bohman, Tom;
Frieze, Alan

Publication type:

Article

Random threshold growth dynamics.

Published in:

Random Structures & Algorithms, 1999, v. 15, n. 1, p. 93, doi. 10.1002/(SICI)1098-2418(199908)15:1<93::AID-RSA4>3.0.CO;2-K

By:

Bohman, Tom;
Gravner, Janko

Publication type:

Article

Coprime mappings and lonely runners.

Published in:

Mathematika, 2022, v. 68, n. 3, p. 784, doi. 10.1112/mtk.12131

By:

Bohman, Tom;
Peng, Fei

Publication type:

Article

Intimate Partner Violence and Psychological Health in a Sample of Asian and Caucasian Women: The Roles of Social Support and Coping.

Published in:

Journal of Family Violence, 2007, v. 22, n. 8, p. 709, doi. 10.1007/s10896-007-9119-6

By:

Lee, Joohee;
Pomeroy, Elizabeth;
Bohman, Tom

Publication type:

Article

Large girth approximate Steiner triple systems.

Published in:

Journal of the London Mathematical Society, 2019, v. 100, n. 3, p. 895, doi. 10.1112/jlms.12242

By:

Bohman, Tom;
Warnke, Lutz

Publication type:

Article

Independent sets in hypergraphs omitting an intersection.

Published in:

Random Structures & Algorithms, 2022, v. 61, n. 3, p. 493, doi. 10.1002/rsa.21071

By:

Bohman, Tom;
Liu, Xizhi;
Mubayi, Dhruv

Publication type:

Article

Dynamic concentration of the triangle‐free process.

Published in:

Random Structures & Algorithms, 2021, v. 58, n. 2, p. 221, doi. 10.1002/rsa.20973

By:

Bohman, Tom;
Keevash, Peter

Publication type:

Article

A note on the random greedy independent set algorithm.

Published in:

Random Structures & Algorithms, 2016, v. 49, n. 3, p. 479, doi. 10.1002/rsa.20667

By:

Bennett, Patrick;
Bohman, Tom

Publication type:

Article