◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Matthew Jenssen

32 papers hereh-index 15653 citations48 works total

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

author position
  • first author16
  • middle author16

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

fields
  • math.CO18
  • math.PR8
  • cs.DS4
  • math.MG1
  • math-ph1
same name
  • Matthew Jenssen — 6 papers, h 4

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
20152026
most citedOn the average size of independent sets in triangle-free graphs

41 citations · 162 across the 24 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 15 cited

Extremes of the internal energy of the Potts model on cubic graphs

Ewan Davies, Matthew Jenssen, Will Perkins +1

We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs…

math.CO2016

Exact Ramsey numbers of odd cycles via nonlinear optimisation

Matthew Jenssen, Jozef Skokan

For a graph G, the k-colour Ramsey number Rk​(G) is the least integer N such that every k-colouring of the edges of the complete graph KN​ contains a monochromatic copy…

math.CO2016★ 41 cited

On the average size of independent sets in triangle-free graphs

Ewan Davies, Matthew Jenssen, Will Perkins +1

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on n vertices with maximum degree d, showing that an independent s…

math.CO2016★ 11 cited

Multicolour Ramsey numbers of paths and even cycles

Ewan Davies, Matthew Jenssen, Barnaby Roberts

We prove new upper bounds on the multicolour Ramsey numbers of paths and even cycles. It is well known that (k−1)n+o(n)≤Rk​(Pn​)≤Rk​(Cn​)≤kn+o(n). The upper bound was…

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