default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXizhi Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j26]Natalie C. Behague, Debsoumya Chakraborti, Xizhi Liu:
Sabotaging Mantel's Theorem. Electron. J. Comb. 33(1) (2026)- [j25]Xizhi Liu, Oleg Pikhurko:
A Note on the Minimum Size of Turán Systems. Electron. J. Comb. 33(1) (2026) - [j24]Jan Grebík, Daniel Král', Xizhi Liu, Oleg Pikhurko, Julia Slipantschuk:
Convergence of spectra of digraph limits. Eur. J. Comb. 134: 104349 (2026) - [j23]Jianfeng Hou, Caiyun Hu, Heng Li, Xizhi Liu
, Caihong Yang, Yixiao Zhang:
Many Vertex-Disjoint Even Cycles of Fixed Length in a Graph. J. Graph Theory 111(3): 67-77 (2026) - 2025
- [j22]Xizhi Liu, Oleg Pikhurko:
A note on extremal constructions for the Erdős-Rademacher problem. Comb. Probab. Comput. 34(1): 52-62 (2025) - [j21]Jianfeng Hou, Caiyun Hu, Heng Li, Xizhi Liu, Caihong Yang, Yixiao Zhang:
Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs. J. Comb. Theory B 172: 221-262 (2025) - [j20]Xizhi Liu, Jialei Song:
Hypergraph Anti-Ramsey Theorems. J. Graph Theory 108(4): 808-816 (2025) - [j19]Jinghua Deng, Jianfeng Hou, Xizhi Liu, Caihong Yang:
Tight Bounds for Rainbow Partial F-Tiling in Edge-Colored Complete Hypergraphs. J. Graph Theory 110(4): 457-467 (2025) - [j18]Jun Gao, Xizhi Liu, Jie Ma, Oleg Pikhurko:
Phase Transition of Degenerate Turán Problems in \({p}\)-Norms. SIAM J. Discret. Math. 39(3): 1712-1736 (2025) - 2024
- [j17]Xizhi Liu, Dhruv Mubayi, David Munhá Correia:
Turán problems in pseudorandom graphs. Comb. Probab. Comput. 33(5): 583-596 (2024) - [j16]Xizhi Liu:
Cancellative hypergraphs and Steiner triple systems. J. Comb. Theory B 167: 303-337 (2024) - [i1]Jianfeng Hou, Xizhi Liu, Hongbin Zhao:
Faster coloring and embedding in dense hypergraphs via stability. CoRR abs/2401.17219 (2024) - 2023
- [j15]Xizhi Liu, Sayan Mukherjee:
Stability theorems for some Kruskal-Katona type results. Eur. J. Comb. 110: 103666 (2023) - [j14]Xizhi Liu, Dhruv Mubayi, Christian Reiher:
A unified approach to hypergraph stability. J. Comb. Theory B 158(Part): 36-62 (2023) - [j13]Xizhi Liu, Dhruv Mubayi, Christian Reiher:
The feasible region of induced graphs. J. Comb. Theory B 158(Part): 105-135 (2023) - [j12]Xizhi Liu, Oleg Pikhurko:
Hypergraph Turán densities can have arbitrarily large algebraic degree. J. Comb. Theory B 161: 407-416 (2023) - 2022
- [j11]Xizhi Liu, Dhruv Mubayi:
A Hypergraph Turán Problem with No Stability. Comb. 42(3): 433-462 (2022) - [j10]Xizhi Liu, Dhruv Mubayi:
On Explicit Constructions of Designs. Electron. J. Comb. 29(1) (2022) - [j9]Xizhi Liu:
Hypergraphs without non-trivial intersecting subgraphs. Comb. Probab. Comput. 31(6): 1076-1091 (2022) - [j8]Xizhi Liu, Jie Ma:
Sparse halves in K 4 -free graphs. J. Graph Theory 99(1): 5-25 (2022) - [j7]Xizhi Liu, Dhruv Mubayi:
On a generalized Erdős-Rademacher problem. J. Graph Theory 100(1): 101-126 (2022) - [j6]Tom Bohman, Xizhi Liu, Dhruv Mubayi:
Independent sets in hypergraphs omitting an intersection. Random Struct. Algorithms 61(3): 493-519 (2022) - [c1]Xizhi Liu, Sayan Mukherjee:
Tight query complexity bounds for learning graph partitions. COLT 2022: 167-181 - 2021
- [j5]Xizhi Liu:
New short proofs to some stability theorems. Eur. J. Comb. 96: 103350 (2021) - [j4]Xizhi Liu, Dhruv Mubayi:
Tight bounds for Katona's shadow intersection theorem. Eur. J. Comb. 97: 103391 (2021) - [j3]Xizhi Liu, Dhruv Mubayi:
The feasible region of hypergraphs. J. Comb. Theory B 148: 23-59 (2021) - 2020
- [j2]Xizhi Liu:
Structural Results for Conditionally Intersecting Families and some Applications. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [j1]Xizhi Liu:
d-cluster-free sets with a given matching number. Eur. J. Comb. 82 (2019)
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 2026-04-05 22:25 CEST 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:
