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...
Váldodahkki: | Illingworth, F |
---|---|
Materiálatiipa: | Journal article |
Giella: | English |
Almmustuhtton: |
2021
|
Geahča maid
Singular Turán Numbers and Worm-Colorings
Dahkki: Gerbner Dániel, et al.
Almmustuhtton: (2022-11-01)
Dahkki: Gerbner Dániel, et al.
Almmustuhtton: (2022-11-01)
Geahča maid
-
On the Turán number of the hypercube
Dahkki: Oliver Janzer, et al.
Almmustuhtton: (2024-01-01) -
The Turán number of three disjoint paths
Dahkki: Jinghua Deng, et al.
Almmustuhtton: (2024-01-01) -
The Turán number of spanning star forests
Dahkki: Lin-Peng Zhang, et al.
Almmustuhtton: (2023-01-01) -
The Turań Number of 2P7
Dahkki: Lan Yongxin, et al.
Almmustuhtton: (2019-11-01) -
Singular Turán Numbers and Worm-Colorings
Dahkki: Gerbner Dániel, et al.
Almmustuhtton: (2022-11-01)