◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Tompkins

4 papers here

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

author position
  • first author1
  • last author2

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

fields
  • math.CO4

identity via Semantic Scholar / OpenAlex

most citedOn an extremal problem involving a pair of forbidden posets

4 citations · 5 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2017

On Edge-Colored Saturation Problems

Michael Ferrara, Daniel Johnston, Sarah Loeb +6

Let C be a family of edge-colored graphs. A t-edge colored graph G is (C,t)-saturated if G does not contain any graph in C but the additi…

math.CO2017★ 4 cited

On an extremal problem involving a pair of forbidden posets

Casey Tompkins, Yao Wang

Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an n-element set avoiding both Yk​ and Yk′​ as induced subpos…

math.CO2017

On the maximum size of connected hypergraphs without a path of given length

Ervin Győri, Abhishek Methuku, Nika Salia +2

In this note we asymptotically determine the maximum number of hyperedges possible in an r-uniform, connected n-vertex hypergraph without a Berge path of length k, as n and…

math.CO2017★ 1 cited

On subgraphs of C2k​-free graphs and a problem of Kühn and Osthus

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let c denote the largest constant such that every C6​-free graph G contains a bipartite and C4​-free subgraph having c fraction of edges of G. Győri et al. showed tha…

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