Остановите войну!
for scientists:
default search action
Tom Bohman
- > Home > Persons > Tom Bohman
Publications
- 2018
- [j42]Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88(3): 449-481 (2018) - 2012
- [i3]Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. CoRR abs/1209.6570 (2012) - 2011
- [j36]Tom Bohman, Alan M. Frieze:
Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 20(5): 721-741 (2011) - [j35]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011) - [i2]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
Random greedy triangle-packing beyond the 7/4 barrier. CoRR abs/1108.1781 (2011) - 2010
- [j34]Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko:
Hypergraphs with independent neighborhoods. Comb. 30(3): 277-293 (2010) - [j33]Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth:
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010) - [j32]Tom Bohman, Alan M. Frieze, Dhruv Mubayi:
Coloring H-free hypergraphs. Random Struct. Algorithms 36(1): 11-25 (2010) - [j31]Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko:
Flips in Graphs. SIAM J. Discret. Math. 24(3): 1046-1055 (2010) - [i1]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
A note on the random greedy triangle-packing algorithm. CoRR abs/1004.2418 (2010) - 2009
- [j28]Tom Bohman, Alan M. Frieze:
Hamilton cycles in 3-out. Random Struct. Algorithms 35(4): 393-417 (2009) - [j27]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23(2): 993-1008 (2009) - 2008
- [j26]Tom Bohman, Alan M. Frieze, Benny Sudakov:
The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008) - [j25]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008) - 2007
- [j24]Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j23]Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Cliff Smyth:
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007) - 2004
- [j18]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin:
Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004) - [j17]Tom Bohman, Alan M. Frieze, Nicholas C. Wormald:
Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25(4): 432-449 (2004) - 2003
- [j16]Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó:
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003) - [j14]Tom Bohman, Alan M. Frieze, Ryan R. Martin:
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003) - [j13]Tom Bohman, Alan M. Frieze:
Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32(2): 326-344 (2003) - 2002
- [j9]Tom Bohman, Alan M. Frieze:
Addendum to avoiding a giant component. Random Struct. Algorithms 20(1): 126-130 (2002) - 2001
- [j8]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
Vertex Covers by Edge Disjoint Cliques. Comb. 21(2): 171-197 (2001) - [j6]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
G-Intersecting Families. Comb. Probab. Comput. 10(5): 367-384 (2001) - [j5]Tom Bohman, Alan M. Frieze:
Avoiding a giant component. Random Struct. Algorithms 19(1): 75-85 (2001) - [c1]Tom Bohman, Alan M. Frieze:
Arc-Disjoint Paths in Expander Digraphs. FOCS 2001: 558-567 - 2000
- [j4]Tom Bohman, Colin Cooper, Alan M. Frieze:
Min-Wise Independent Linear Permutations. Electron. J. Comb. 7 (2000) - [j3]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
Note on Sparse Random Graphs and Cover Graphs. Electron. J. Comb. 7 (2000)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-02 01:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint