Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJie Ma 0002
Person information
- affiliation: University of Science and Technology of China, Hefei, Anhui, China
- affiliation (former): Georgia Institute of Technology, Atlanta, GA, USA
Other persons with the same name
- Jie Ma — disambiguation page
- Jie Ma 0001
![[0000-0002-7432-3238]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-7432-3238")
— Xi'an Jiaotong University, Xi'an, Shaanxi, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j35]Jun Gao, Jie Ma:
Tight Bounds Towards a Conjecture of Gallai. Comb. 43(3): 447-453 (2023)- [j34]Cong Luo, Jie Ma, Tianchi Yang:
On the maximum number of edges in -critical graphs. Comb. Probab. Comput. 32(6): 900-911 (2023) - [j33]Tao Jiang, Jie Ma, Liana Yepremyan:
Linear cycles of consecutive lengths. J. Comb. Theory, Ser. B 163: 1-24 (2023) - [j32]Jie Ma, Chunlei Zu:
Towards a conjecture of Birmelé-Bondy-Reed on the Erdős-Pósa property of long cycles. J. Graph Theory 103(1): 148-158 (2023) - 2022
- [j31]Tao Jiang, Jie Ma, Liana Yepremyan:
On Turán exponents of bipartite graphs. Comb. Probab. Comput. 31(2): 333-344 (2022) - [j30]Binlong Li, Jie Ma, Bo Ning:
Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. J. Comb. Theory, Ser. B 152: 399-414 (2022) - [j29]Xizhi Liu, Jie Ma:
Sparse halves in K 4 -free graphs. J. Graph Theory 99(1): 5-25 (2022) - 2021
- [j28]Jie Ma, Tianchi Yang:
Counting Critical Subgraphs in k-Critical Graphs. Comb. 41(5): 669-694 (2021) - [j27]Jialin He, Jie Ma, Tianchi Yang:
Some extremal results on 4-cycles. J. Comb. Theory, Ser. B 149: 92-108 (2021) - 2020
- [j26]Jie Ma, Bo Ning:
Stability Results on the Circumference of a Graph. Comb. 40(1): 105-147 (2020) - [j25]Jie Ma, Tianyun Tang, Xingxing Yu:
Monochromatic Subgraphs in Iterated Triangulations. Electron. J. Comb. 27(4): 4 (2020) - [j24]Jie Ma, Yu Qiu:
Some sharp results on the generalized Turán numbers. Eur. J. Comb. 84 (2020) - [j23]Jun Gao, Jie Ma:
On a conjecture of Bondy and Vince. J. Comb. Theory, Ser. B 141: 136-142 (2020) - [j22]Jun Gao, Jie Ma:
A Conjecture of Verstraëte on Vertex-Disjoint Cycles. SIAM J. Discret. Math. 34(2): 1290-1301 (2020)
2010 – 2019
- 2019
- [j21]Yuliang Ji, Jie Ma, Juan Yan, Xingxing Yu:
On problems about judicious bipartitions of graphs. J. Comb. Theory, Ser. B 139: 230-250 (2019) - [j20]Jie Ma, Tianchi Yang:
Decomposing C4-free graphs under degree constraints. J. Graph Theory 90(1): 13-23 (2019) - 2018
- [j19]Chun-Hung Liu, Jie Ma:
Cycle lengths and minimum degree of graphs. J. Comb. Theory, Ser. B 128: 66-95 (2018) - [j18]Tao Jiang, Jie Ma:
Cycles of given lengths in hypergraphs. J. Comb. Theory, Ser. B 133: 54-77 (2018) - [j17]Jie Ma, Xiaofan Yuan, Mingwei Zhang:
Some extremal results on complete degenerate hypergraphs. J. Comb. Theory, Ser. A 154: 598-609 (2018) - [j16]Ringi Kim, Seog-Jin Kim, Jie Ma, Boram Park:
Cycles with two blocks in k-chromatic digraphs. J. Graph Theory 88(4): 592-605 (2018) - 2017
- [j15]Jie Ma:
On edges not in monochromatic copies of a fixed bipartite graph. J. Comb. Theory, Ser. B 123: 240-248 (2017) - 2016
- [j14]Jie Ma, Xingxing Yu:
On judicious bipartitions of graphs. Comb. 36(5): 537-556 (2016) - [j13]Jie Ma:
Cycles with consecutive odd lengths. Eur. J. Comb. 52: 74-78 (2016) - [j12]Po-Shen Loh, Jie Ma:
Diameter critical graphs. J. Comb. Theory, Ser. B 117: 34-58 (2016) - [j11]Jie Ma, Qiqin Xie, Xingxing Yu:
Graphs Containing Topological H. J. Graph Theory 82(2): 121-153 (2016) - 2015
- [j10]Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu:
Subdivisions of K5 in graphs containing K2, 3. J. Comb. Theory, Ser. B 113: 18-67 (2015) - [j9]Zhibin Chen, Jie Ma, Wenan Zang:
Coloring digraphs with forbidden cycles. J. Comb. Theory, Ser. B 115: 210-223 (2015) - [j8]Jie Ma, Humberto Naves:
Maximizing proper colorings on graphs. J. Comb. Theory, Ser. B 115: 236-275 (2015) - 2013
- [j7]Jie Ma, Xingxing Yu, Wenan Zang:
Approximate min-max relations on plane graphs. J. Comb. Optim. 26(1): 127-134 (2013) - [j6]Jie Ma, Xingxing Yu:
K5-Subdivisions in graphs containing K-4. J. Comb. Theory, Ser. B 103(6): 713-732 (2013) - 2012
- [j5]Jie Ma, Xingxing Yu:
Partitioning 3-uniform hypergraphs. J. Comb. Theory, Ser. B 102(1): 212-232 (2012) - 2011
- [j4]Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu:
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J. Comb. Theory, Ser. B 101(4): 214-236 (2011) - 2010
- [j3]Jie Ma, Xingxing Yu:
Bounds for pairs in partitions of graphs. Discret. Math. 310(15-16): 2069-2081 (2010) - [j2]Jie Ma, Xingxing Yu:
Independent paths and K5-subdivisions. J. Comb. Theory, Ser. B 100(6): 600-616 (2010) - [j1]Jie Ma, Pei-Lan Yen, Xingxing Yu:
On several partitioning problems of Bollobás and Scott. J. Comb. Theory, Ser. B 100(6): 631-649 (2010)
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-04-19 19:32 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:
