- 21228 Discrete Mathematics Course Review 3
- 21228 Discrete Mathematics Course Review 1
- 21228 Discrete Mathematics Course Review 2
- On the Irregularity Strength of Trees Tom Bohman # , David Kravitz +
- Hamilton cycles in 3out Tom Bohman # and Alan Frieze +
- 21228 Discrete Mathematics Assignment # 8: Solutions
- The Saturation Function of Complete Partite Tom Bohman1,3
- On the Independence Numbers of the Cubes of Odd Cycles Tom Bohman # Ron Holzman + Venkatesh Natarajan #
- A Phase Transition for Avoiding a Giant Tom Bohman Jeong Han Kim
- Avoiding a Giant Component Tom Bohman and Alan Frieze y
- Creating a Giant Component Tom Bohman y , David Kravitz z
- Arc-Disjoint Paths in Expander Digraphs Tom Bohman and Alan Frieze y
- Random Threshold Growth Dynamics Tom Bohman \Lambda
- 21-228 Discrete Mathematics Assignment # 6: Solutions
- Graduiertenkolleg: Methods for Discrete Structures (Pre-)Doc-Course 2010: Probabilistic Combinatorics
- A Nontrivial Lower Bound on the Shannon Capacities of the Complements of Odd Cycles
- ErdosKoRado in Random Hypergraphs Jozsef Balogh # Tom Bohman + Dhruv Mubayi #
- Vertex covers by edge disjoint cliques Tom Bohman Alan Frieze Mikl os Ruszink o y
- 21-228 Discrete Mathematics Course Review 1
- On a List Coloring Conjecture of Reed Tom Bohman Ron Holzman y
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- The TriangleFree Process Tom Bohman #
- A note on the random greedy trianglepacking algorithm Tom Bohman # Alan Frieze + Eyal Lubetzky #
- KarpSipser on random graphs with a fixed degree Tom Bohman # and Alan Frieze +
- KarpSipser on random graphs with a fixed degree Tom Bohman # and Alan Frieze +
- 21-228 Discrete Mathematics Assignment # 8: Solutions
- G-intersecting Families Tom Bohman Alan Frieze Mikl os Ruszink o yz
- Coloring H-free hypergraphs , Alan Frieze
- Invent math (2010) 181: 291336 DOI 10.1007/s00222-010-0247-x
- Hypergraphs with independent neighborhoods Tom Bohman 1,# Alan Frieze 1,+ Dhruv Mubayi 1,2,# Oleg Pikhurko 1,
- On Partitions of Discrete Boxes Noga Alon Tom Bohman y Ron Holzman z
- 21-228 Discrete Mathematics Assignment # 2: Solutions
- Linear versus Hereditary Discrepancy Tom Bohman y Ron Holzman z
- SIR epidemics on random graphs with a fixed degree sequence Tom Bohman # Michael Picollelli +
- Avoidance of a giant component in half the edge set of a random graph
- Anti-Ramsey Properties of Random Graphs , Alan Frieze
- 21-228 Discrete Mathematics Assignment # 3
- 21-228 Discrete Mathematics Assignment # 5: Solutions
- 21-228 Discrete Mathematics Course Review 2
- 21-228 Discrete Mathematics Assignment # 7: Solutions
- 21-228 Discrete Mathematics Course Review 3
- Arc-Disjoint Paths in Expander Digraphs Tom Bohman and Alan Frieze y
- How many random edges make a dense graph hamiltonian? Tom Bohman Alan Frieze y Ryan Martin z
- Graduiertenkolleg: Methods for Discrete Structures (Pre-)Doc-Course 2010: Probabilistic Combinatorics
- 21-301 Combinatorics Fall 2011 MWF 12:30-1:20 Baker Hall A51
- 21-701 Discrete Mathematics Fall 2011 MWF 3:30-4:20 Wean Hall 6423
- 21301 Combinatorics Fall 2011 MWF 12:301:20 Baker Hall A51
- 21701 Discrete Mathematics Fall 2011 MWF 3:304:20 Wean Hall 6423
- 21-301 Combinatorics Suggested exercises for the week of October 3
- 21-301 Combinatorics Suggested exercises for the week of October 17
- 21301 Combinatorics Suggested exercises for the week of October 3
- 21228 Discrete Mathematics Spring 2012 MWF 2:303:20 Doherty 2302
- 21-228 Discrete Mathematics Spring 2012 MWF 2:30-3:20 Doherty 2302
