Artikel dengan mandat akses publik - Xiaoyu HePelajari lebih lanjut
Tersedia di suatu tempat: 19
Online Ramsey numbers and the subgraph query problem
D Conlon, J Fox, A Grinshpun, X He
Building Bridges II: Mathematics of László Lovász, 159-194, 2020
Mandat: US National Science Foundation, European Commission, Royal Society UK
Card guessing with partial feedback
P Diaconis, R Graham, X He, S Spiro
Combinatorics, Probability and Computing 31 (1), 1-20, 2022
Mandat: US National Science Foundation
Independent sets in hypergraphs with a forbidden link
J Fox, X He
Proceedings of the London Mathematical Society 123 (4), 384-409, 2021
Mandat: US National Science Foundation
The zero-rate threshold for adversarial bit-deletions is less than 1/2
V Guruswami, X He, R Li
IEEE Transactions on Information Theory 69 (4), 2218-2239, 2022
Mandat: US National Science Foundation
A proof of Tomescu's graph coloring conjecture
J Fox, X He, F Manners
Journal of Combinatorial Theory, Series B 136, 204-221, 2019
Mandat: US National Science Foundation
Hedetniemi's conjecture is asymptotically false
X He, Y Wigderson
Journal of Combinatorial Theory, Series B 146, 485-494, 2021
Mandat: US National Science Foundation
Zero-sum subsequences of length kq over finite abelian p-groups
X He
Discrete Mathematics 339 (1), 399-407, 2016
Mandat: US National Science Foundation
On the subgraph query problem
R Alweiss, CB Hamida, X He, A Moreira
Combinatorics, Probability and Computing 30 (1), 1-16, 2021
Mandat: US National Science Foundation
An upper bound for the restricted online Ramsey number
D Gonzalez, X He, H Zheng
Discrete Mathematics 342 (9), 2564-2569, 2019
Mandat: US National Science Foundation
Logarithmically larger deletion codes of all distances
N Alon, G Bourla, B Graham, X He, N Kravitz
IEEE Transactions on Information Theory 70 (1), 125-130, 2023
Mandat: US National Science Foundation
Shuffle squares and reverse shuffle squares
X He, E Huang, I Nam, R Thaper
European Journal of Combinatorics 116, 103883, 2024
Mandat: US National Science Foundation
Tomescu's Graph Coloring Conjecture for -Connected Graphs
J Engbers, A Erey, J Fox, X He
SIAM Journal on Discrete Mathematics 35 (2), 1478-1502, 2021
Mandat: US National Science Foundation, Scientific and Technological Research …
Down‐set thresholds
B Gunby, X He, B Narayanan
Random Structures & Algorithms 63 (2), 442-456, 2023
Mandat: US National Science Foundation
Multicolor list Ramsey numbers grow exponentially
J Fox, X He, S Luo, MW Xu
Journal of Graph Theory 101 (3), 389-396, 2022
Mandat: US National Science Foundation
Hypergraph Ramsey numbers of cliques versus stars
D Conlon, J Fox, X He, D Mubayi, A Suk, J Verstraëte
Random Structures & Algorithms 63 (3), 610-623, 2023
Mandat: US National Science Foundation
Ramsey, paper, scissors
J Fox, X He, Y Wigderson
Random Structures & Algorithms 57 (4), 1157-1173, 2020
Mandat: US National Science Foundation
Antichain codes
B Gunby, X He, B Narayanan, S Spiro
Bulletin of the London Mathematical Society 55 (6), 3053-3062, 2023
Mandat: US National Science Foundation
Approximating binary longest common subsequence in almost-linear time
X He, R Li
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1145-1158, 2023
Mandat: US National Science Foundation
Maximal independent sets in clique-free graphs
X He, J Nie, S Spiro
European Journal of Combinatorics 106, 103575, 2022
Mandat: US National Science Foundation
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer