Generalized Tur��n problems for complete bipartite graphs
| Autor: | Gerbner, D��niel, Patk��s, Bal��zs |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| DOI: | 10.48550/arxiv.2101.08094 |
| Popis: | For graph $G$, $F$ and integer $n$, the generalized Tu��n number $ex(n,G,F)$ denotes the maximum number of copies of $G$ that an $F$-free $n$-vertex graph can have. We study this parameter when both $G$ and $F$ are complete bipartite graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|