C. Palmer

activity

20112026

most citedCounting copies of a fixed subgraph in

F

-free graphs

74 citations · 102 across the 28 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

General lemmas for Berge-Turán hypergraph problems

Dániel Gerbner, Abhishek Methuku, Cory Palmer

For a graph $F$ , a hypergraph $H$ is a Berge copy of $F$ (or a Berge- $F$ in short), if there is a bijection $f : E (F) \to E (H)$ such that for each $e \i…

math.CO2018★ 74 cited

Counting copies of a fixed subgraph in $F$ -free graphs

Dániel Gerbner, Cory Palmer

Fix graphs $F$ and $H$ and let $e x (n, H, F)$ denote the maximum possible number of copies of the graph $H$ in an $n$ -vertex $F$ -free graph. The systematic study of this function was…

General lemmas for Berge-Turán hypergraph problems

Counting copies of a fixed subgraph in F-free graphs

Counting copies of a fixed subgraph in $F$ -free graphs