Choongbum Lee

Computational Theory and Mathematics · 2012–2015

A researcher in the Science corpus: 4 papers; trusts 3 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 10 citations into it; #6,915 of 12,182 by trust here, #10,901 by citations
• Discrete Mathematics and Combinatorics — 7 citations into it; #1,101 of 2,017 by trust here, #1,692 by citations
• Geometry and Topology — 6 citations into it; #4,392 of 7,422 by trust here, #6,497 by citations

Whom Choongbum Lee trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. David Conlon
2. George L. Nemhauser

Who trusts Choongbum Lee overall

1. David Conlon
2. D. Kühn
3. Joonkyung Lee

Papers from Choongbum Lee's perspective

Ordered by how strongly the researchers Choongbum Lee trusts endorse each paper. Same corpus, a different order for every researcher.

1. The number of cliques in graphs of given order and size
2. A new upper bound for diagonal Ramsey numbers
3. A combinatorial problem in geometry
4. Graph norms and Sidorenko’s conjecture
5. Reducibility Among Combinatorial Problems
6. The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$
7. Wiley‐Interscience Series in Discrete Mathematics and Optimization
8. Tur an Numbers of Bipartite Graphs and Related Ramsey-Type Questions
9. Proof of the bandwidth conjecture of Bollobás and Komlós
10. Markov Random Field Modeling in Image Analysis (Computer Science Workbench)

Their papers

• Two Approaches to Sidorenko's Conjecture (2013) — 78 citations
• Robust Hamiltonicity of Dirac graphs (2012) — 60 citations
• Ramsey numbers of degenerate graphs (2015) — 51 citations
• The Erdős–Gyárfás problem on generalized Ramsey numbers (2014) — 56 citations