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...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Journal article |
| Γλώσσα: | English |
| Έκδοση: |
2021
|
| _version_ | 1826281762903293952 |
|---|---|
| author | Illingworth, F |
| author_facet | Illingworth, F |
| author_sort | Illingworth, F |
| collection | OXFORD |
| description | <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
complete bipartite graph. In this short note, we complement this focus by
asymptotically determining the induced Turán number whenever $H$ is not
bipartite and $F$ is not an independent set nor a complete bipartite graph.</p> |
| first_indexed | 2024-03-07T00:33:41Z |
| format | Journal article |
| id | oxford-uuid:80adc47f-c010-44a5-b46c-104aa81c856b |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T00:33:41Z |
| publishDate | 2021 |
| record_format | dspace |
| spelling | oxford-uuid:80adc47f-c010-44a5-b46c-104aa81c856b2022-03-26T21:24:58ZA note on induced Turán numbersJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:80adc47f-c010-44a5-b46c-104aa81c856bEnglishSymplectic Elements2021Illingworth, F<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 complete bipartite graph. In this short note, we complement this focus by asymptotically determining the induced Turán number whenever $H$ is not bipartite and $F$ is not an independent set nor a complete bipartite graph.</p> |
| spellingShingle | Illingworth, F A note on induced Turán numbers |
| title | A note on induced Turán numbers |
| title_full | A note on induced Turán numbers |
| title_fullStr | A note on induced Turán numbers |
| title_full_unstemmed | A note on induced Turán numbers |
| title_short | A note on induced Turán numbers |
| title_sort | note on induced turan numbers |
| work_keys_str_mv | AT illingworthf anoteoninducedturannumbers AT illingworthf noteoninducedturannumbers |