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...
Yazar: | Illingworth, F |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
2021
|
Benzer Materyaller
-
On the Turán number of the hypercube
Yazar:: Oliver Janzer, ve diğerleri
Baskı/Yayın Bilgisi: (2024-01-01) -
The Turán number of three disjoint paths
Yazar:: Jinghua Deng, ve diğerleri
Baskı/Yayın Bilgisi: (2024-01-01) -
The Turán number of spanning star forests
Yazar:: Lin-Peng Zhang, ve diğerleri
Baskı/Yayın Bilgisi: (2023-01-01) -
The Turań Number of 2P7
Yazar:: Lan Yongxin, ve diğerleri
Baskı/Yayın Bilgisi: (2019-11-01) -
Singular Turán Numbers and Worm-Colorings
Yazar:: Gerbner Dániel, ve diğerleri
Baskı/Yayın Bilgisi: (2022-11-01)