Boris Bukh, Ph.D.
Affiliations: | 2008 | Princeton University, Princeton, NJ |
Area:
MathematicsGoogle:
"Boris Bukh"Parents
Sign in to add mentor| Benjamin Sudakov | grad student | 2008 | Princeton | |
| (Extremal problems in combinatorial geometry and additive combinatorics.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bukh B, Rudenko O. (2020) Order-Isomorphic Twins in Permutations Siam Journal On Discrete Mathematics. 34: 1620-1622 |
| Bukh B, Hogenson R. (2020) Length of the Longest Common Subsequence between Overlapping Words Siam Journal On Discrete Mathematics. 34: 721-729 |
| Bukh B, Hubard A. (2020) On a topological version of Pach's overlap theorem Bulletin of the London Mathematical Society. 52: 275-282 |
| Bukh B, Tait M. (2020) Turán numbers of theta graphs Combinatorics, Probability & Computing. 29: 495-507 |
| Bukh B, Cox C. (2019) On a Fractional Version of Haemers’ Bound Ieee Transactions On Information Theory. 65: 3340-3348 |
| Bukh B, Conlon D. (2018) Rational exponents in extremal graph theory Journal of the European Mathematical Society. 20: 1747-1757 |
| Bukh B, Jiang Z. (2018) Bipartite algebraic graphs without quadrilaterals Discrete Mathematics. 341: 1597-1604 |
| Bukh B, Jiang Z. (2017) Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’ Combinatorics, Probability & Computing. 26: 952-953 |
| BUKH B, JIANG Z. (2016) A Bound on the Number of Edges in Graphs Without an Even Cycle Combinatorics Probability and Computing. 1-15 |
| Bukh B. (2016) An improvement of the Beck-Fiala theorem Combinatorics Probability and Computing. 25: 380-398 |