Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized Turán results for matchings

Published 20 Apr 2024 in math.CO | (2404.13335v1)

Abstract: Given graphs $H$ and $F$, the generalized Tur\'an number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in $n$-vertex $F$-free graphs. We study the case when either $H$ or $F$ is a matching. We obtain several asymptotic and exact results.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Dániel Gerbner 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.

Sign Up for Free