◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jie Ma

50 papers hereh-index 16764 citations78 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author18
  • middle author16
  • last author14

Across the 50 of 50 papers where every author was matched, so the position is known.

fields
  • math.CO49
  • math.NT1
same name
  • Jie Ma — 19 papers, h 8
  • Jie Ma — 16 papers, h 15
  • Jie Ma — 15 papers, h 30
  • Jie Ma — 11 papers, h 18
  • Jie Ma — 11 papers, h 9
  • Jie Ma — 9 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20122026
most citedStability results on the circumference of a graph

17 citations · 84 across the 50 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.CO2014

Maximizing proper colorings on graphs

Jie Ma, Humberto Naves

The number of proper q-colorings of a graph G, denoted by PG​(q), is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…

math.CO2014★ 3 cited

Cycles with consecutive odd lengths

Jie Ma

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cyc…

math.CO2014

Diameter critical graphs

Po-Shen Loh, Jie Ma

A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a co…

math.CO2014★ 1 cited

Longest common subsequences in sets of words

Boris Bukh, Jie Ma

Given a set of t words of length n over a k-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-…

math.CO2014

Coloring Digraphs with Forbidden Cycles

Zhibin Chen, Jie Ma, Wenan Zang

Let k and r be two integers with k≥2 and k≥r≥1. In this paper we show that (1) if a strongly connected digraph D contains no directed cycle of length 1 modul…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.