Large Multipartite Subgraphs in H-free Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F21%3A00355453" target="_blank" >RIV/68407700:21340/21:00355453 - isvavai.cz</a>
Result on the web
<a href="http://hdl.handle.net/10467/99603" target="_blank" >http://hdl.handle.net/10467/99603</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_113" target="_blank" >10.1007/978-3-030-83823-2_113</a>

Result language
angličtina
Original language name
Large Multipartite Subgraphs in H-free Graphs
Original language description
In this work, we discuss a strengthening of a result of Füredi that every n-vertex K_{r+1}-free graph can be made r-partite by removing at most T(n, r) - e(G) edges, where T(n,r)=(r-1)/(2r) * n^2 denotes the number of edges of the n-vertex r-partite Turán graph. As a corollary, we answer a problem of Sudakov and prove that every K6 -free graph can be made bipartite by removing at most 4n^2/ 25 edges. The main tool we use is the flag algebra method applied to locally definied vertex-partitions.
Czech name
—
Czech description
—

Project
<a href="/en/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Center for advanced applied science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)