Choongbum Lee, UCLA

Choongbum Lee

Deparment of Mathematics, UCLA

Preprints

• S. Das, C. Lee, and B. Sudakov, Rainbow Turan problem for even cycles, submitted.
• M. Krivelevich, C. Lee, and B. Sudakov, Robust Hamiltonicity of Dirac graphs, submitted.
• C. Lee, P. Loh, and B. Sudakov, Self-similarity of graphs, submitted.
• C. Lee, P. Loh, and B. Sudakov, Bisections of graphs, submitted.

To Appear

• C. Lee, B. Sudakov, and D. Vilenchik, Getting directed Hamilton cycle twice faster, Comb. Probab. Comput., DOI:10.1017/S096354831200020X.
• J. Fox, C. Lee, and B. Sudakov, Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz, Combinatorica, to appear.
• C. Lee and B. Sudakov, Dirac's theorem for random graphs, Random Struct. Algor., DOI:10.1002/rsa.20419.
• C. Lee and W. Samotij, Pancyclic subgraphs of random graph, J. Graph Theory, DOI:10.1002/jgt.20638.
• J. Fox, C. Lee, and B. Sudakov, Maximum union-free subfamilies, Israel J. Math., DOI:10.1007/s11856.
• H. Huang and C. Lee, Quasi-randomness of graph balanced cut properties, Random Struct. Algor., DOI:10.1002/rsa.20384.
• C. Lee, J. Lee, and S. Oum, Rank-width of random graphs, J. Graph Theory, DOI:10.1002/jgt.20620.

2012

• J. Balogh, C. Lee, and W. Samotij, Corradi and Hajnal's theorem for sparse random graphs, Comb. Probab. Comput. 21 (2012), 23-55.
• C. Lee and B. Sudakov, Hamiltonicity, independence number, and pancyclicity, European J. Combin. 33 (2012), 449-457.
• H. Huang, C. Lee, and B. Sudakov, Bandwidth theorem for random graphs, J. Comb. Theory B 102 (2012), 14-37.

2009-2011

• M. Krivelevich, C. Lee, and B. Sudakov, Resilient pancyclicity of random and pseudorandom graphs, SIAM J. Discrete Math. 24 (2010), 1-16.
• C. Lee, On the size of minimal unsatisfiable formulas, Electron. J. Comb. 16 (2009), N3.

Contact : abdesire @ ucla d..o..t edu