◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

John Lenz

14 papers hereh-index 10350 citations27 works total

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

author position
  • first author7
  • middle author3
  • last author4

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

fields
  • math.CO14

identity via Semantic Scholar / OpenAlex

activity
20092015
most citedOn the Ramsey-Turán numbers of graphs and hypergraphs

19 citations · 65 across the 11 of their papers we have counts for

collaborators
Showing 2011Show all

3 papers · 1 filter

math.CO2011★ 19 cited

On the Ramsey-Turán numbers of graphs and hypergraphs

József Balogh, John Lenz

Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RT_t(n, H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G where…

math.CO2011★ 12 cited

Some Exact Ramsey-Turán Numbers

József Balogh, John Lenz

Let r be an integer, f(n) a function, and H a graph. Introduced by Erdős, Hajnal, Sós, and Szemerédi, the r-Ramsey-Turán number of H, RT_r(n, H, f(n)), is defined to be the maximum…

math.CO2011★ 8 cited

On the Chromatic Thresholds of Hypergraphs

József Balogh, Jane Butterfield, Ping Hu +2

Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minim…

◍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.