A note on induced Turán numbers
<p>Loh, Tait, Timmons and Zhou introduced the notion of induced Turán numbers, defining $\operatorname{ex}(n, \{H, F\text{-ind}\})$ to be the greatest number of edges in an $n$-vertex graph with no copy of $H$ and no induced copy of $F$. Their and subsequent work has focussed on $F$ being a co...
Main Author: | Illingworth, F |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2021
|
Similar Items
-
On the Turán number of the hypercube
by: Oliver Janzer, et al.
Published: (2024-01-01) -
The Turán number of three disjoint paths
by: Jinghua Deng, et al.
Published: (2024-01-01) -
The Turán number of spanning star forests
by: Lin-Peng Zhang, et al.
Published: (2023-01-01) -
The Turań Number of 2P7
by: Lan Yongxin, et al.
Published: (2019-11-01) -
Singular Turán Numbers and Worm-Colorings
by: Gerbner Dániel, et al.
Published: (2022-11-01)