default search action
Yi Zhao 0005
Person information
- affiliation: Georgia State University, Department of Mathematics and Statistics, Atlanta, GA, USA
Other persons with the same name
- Yi Zhao — disambiguation page
- Yi Zhao 0001 — University of Southampton, UK
- Yi Zhao 0002
— Shenzhen University, College of Mathematics and Statistics, China (and 1 more)
- Yi Zhao 0003 — Marvell Semiconductor, Santa Clara, CA, USA (and 1 more)
- Yi Zhao 0004
- Yi Zhao 0006
- Yi Zhao 0007
- Yi Zhao 0008
- Yi Zhao 0009
- Yi Zhao 0010
- Yi Zhao 0011
- Yi Zhao 0012 — University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j37]Abhijeet Bhalkikar, Yi Zhao
On subgraphs of tripartite graphs. Discret. Math. 346(1): 113152 (2023) - 2022
- [j36]Jie Han, Yi Zhao:
Turán Number of Disjoint Triangles in 4-Partite Graphs. Electron. J. Comb. 29(2) (2022) - [j35]Allan Lo, Andrew Treglown, Yi Zhao:
Complete subgraphs in a multipartite graph. Comb. Probab. Comput. 31(6): 1092-1101 (2022) - [j34]Hiêp Hàn, Jie Han, Yi Zhao:
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs. J. Comb. Theory B 153: 105-148 (2022) - 2021
- [j33]Yangyang Cheng, Guanghui Wang, Yi Zhao:
Rainbow Pancyclicity in Graph Systems. Electron. J. Comb. 28(3): 3 (2021) - [j32]Guantao Chen, Xiaowei Yu, Yi Zhao:
Improved bounds on the Ramsey number of fans. Eur. J. Comb. 96: 103347 (2021) - 2020
- [j31]Jie Han, Yi Zhao:
Hamiltonicity in randomly perturbed hypergraphs. J. Comb. Theory B 144: 14-31 (2020) - [j30]Jie Han
Matchings in k-partite k-uniform hypergraphs. J. Graph Theory 95(1): 34-58 (2020) - [j29]Victor Falgas-Ravry
Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57(4): 1097-1133 (2020)
2010 – 2019
- 2019
- [j28]Wei Gao, Jie Han, Yi Zhao:
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. Comb. Probab. Comput. 28(6): 840-870 (2019) - [i1]Victor Falgas-Ravry, Klas Markström, Yi Zhao:
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. CoRR abs/1901.09560 (2019) - 2018
- [j27]Yi Zhang, Yi Zhao, Mei Lu:
Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j26]Kirsten Hogenson
Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case. Graphs Comb. 34(5): 1049-1075 (2018) - [j25]Peter Frankl, Jie Han, Hao Huang, Yi Zhao
A degree version of the Hilton-Milner theorem. J. Comb. Theory A 155: 493-502 (2018) - 2017
- [j24]Albert Bush, Yi Zhao:
New Upper Bound for Sums of Dilates. Electron. J. Comb. 24(3): 3 (2017) - [j23]Jie Han
Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. 26(6): 856-885 (2017) - [j22]Daniela Kühn, Deryk Osthus, Timothy Townsend, Yi Zhao:
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. J. Comb. Theory B 124: 88-127 (2017) - [j21]Jie Han
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. J. Comb. Theory A 149: 115-147 (2017) - [j20]Hao Huang, Yi Zhao:
Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture. J. Comb. Theory A 150: 233-247 (2017) - 2016
- [j19]Andrew Treglown, Yi Zhao:
A Note on Perfect Matchings in Uniform Hypergraphs. Electron. J. Comb. 23(1): 1 (2016) - [j18]Jie Han
Forbidding Hamilton cycles in uniform hypergraphs. J. Comb. Theory A 143: 107-115 (2016) - [j17]Victor Falgas-Ravry
Codegree Thresholds for Covering 3-Uniform Hypergraphs. SIAM J. Discret. Math. 30(4): 1899-1917 (2016) - 2015
- [j16]Jie Han
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory B 114: 70-96 (2015) - [j15]Jie Han
Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs. J. Comb. Theory A 132: 194-223 (2015) - [j14]Jie Han
Minimum vertex degree threshold for C43-tiling. J. Graph Theory 79(4): 300-317 (2015) - 2013
- [j13]Jie Han
On multipartite Hajnal-Szemerédi theorems. Discret. Math. 313(10): 1119-1129 (2013) - [j12]Andrew Treglown, Yi Zhao:
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. J. Comb. Theory A 120(7): 1463-1482 (2013) - [j11]Yi Zhao, Sha Yang, Vishal Narayan, Ying Zhao
Modeling Consumer Learning from Online Product Reviews. Mark. Sci. 32(1): 153-169 (2013) - [c3]Ayush Shrestha, Ying Zhu
Storygraph: Telling Stories from Spatio-temporal Data. ISVC (2) 2013: 693-702 - [c2]Ayush Shrestha, Ben Miller, Ying Zhu
Storygraph: extracting patterns from spatio-temporal data. IDEA@KDD 2013: 95-103 - 2012
- [j10]Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao:
Hamiltonian cycles with all small even chords. Discret. Math. 312(6): 1226-1240 (2012) - [j9]Andrew Treglown, Yi Zhao:
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. J. Comb. Theory A 119(7): 1500-1522 (2012) - [j8]Albert Bush, Yi Zhao:
Minimum degree thresholds for bipartite graph tiling. J. Graph Theory 70(1): 92-120 (2012) - [j7]József Balogh, Tom Bohman
Turán Densities of Some Hypergraphs Related to Kk+1k. SIAM J. Discret. Math. 26(4): 1609-1617 (2012) - 2011
- [j6]Yingshu Li
Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 22(4): 695-703 (2011) - 2010
- [j5]Sha Yang, Yi Zhao, Ravi Dhar:
Modeling the Underreporting Bias in Panel Survey Data. Mark. Sci. 29(3): 525-539 (2010)
2000 – 2009
- 2009
- [j4]Ryan R. Martin, Yi Zhao:
Tiling Tripartite Graphs with 3-Colorable Graphs. Electron. J. Comb. 16(1) (2009) - [c1]Chinh T. Vu, Guantao Chen, Yi Zhao, Yingshu Li:
A universal framework for partial coverage in Wireless Sensor Networks. IPCCC 2009: 1-8 - 2007
- [j3]Dhruv Mubayi, Yi Zhao:
Forbidding Complete Hypergraphs as Traces. Graphs Comb. 23(6): 667-679 (2007) - [j2]Peter Keevash, Yi Zhao:
Codegree problems for projective geometries. J. Comb. Theory B 97(6): 919-928 (2007) - [j1]Dhruv Mubayi, Yi Zhao:
Co-degree density of hypergraphs. J. Comb. Theory A 114(6): 1118-1132 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: