◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

John Fairfax-Ball

5 papers hereh-index 00 citations1 works total

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

author position
  • sole author5

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

fields
  • math.CO3
  • math.NT2

identity via Semantic Scholar / OpenAlex

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2026

Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders

John Fairfax-Ball

Choose a uniformly random ordering of the vertices of a finite tree and run the usual greedy maximal-independent-set algorithm. We compare the resulting law on maximal independent…

math.CO2026

A Fixed-Offset Transition for Random Stackability on Paths

John Fairfax-Ball

We study a support-collapse version of graph pebbling on paths. A configuration is stackable if a sequence of legal pebbling moves can produce a nonzero configuration supported on…

math.CO2026

The stacking number of a tree

John Fairfax-Ball

Csernák and Soukup introduced the stacking number of a graph: the least integer t≥2 such that every configuration of t pebbles can be transformed by pebbling moves into a con…

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