10 Problems for Partitions of Triangle-free Graphs
dc.contributor.author | Balogh, József | |
dc.contributor.author | Clemen, Felix Christian | |
dc.contributor.author | Lidicky, Bernard | |
dc.contributor.department | Mathematics | |
dc.date.accessioned | 2022-04-06T18:27:23Z | |
dc.date.available | 2022-04-06T18:27:23Z | |
dc.date.issued | 2022 | |
dc.description.abstract | We will state 10 problems, and solve some of them, for partitions in triangle-free graphs related to Erdős' Sparse Half Conjecture. Among others we prove the following variant of it: For every sufficiently large even integer n the following holds. Every triangle-free graph on n vertices has a partition V(G)=A∪B with |A|=|B|=n/2 such that e(G[A])+e(G[B])≤n2/16. This result is sharp since the complete bipartite graph with class sizes 3n/4 and n/4 achieves equality, when n is a multiple of 4. Additionally, we discuss similar problems for K4-free graphs. | |
dc.description.comments | This preprint is made available through arXiv at doi:https://doi.org/10.48550/arXiv.2203.15764. Posted with permission. This work is licensed under the Creative Commons Attribution 4.0 License. | |
dc.identifier.uri | https://dr.lib.iastate.edu/handle/20.500.12876/PrMBPXpz | |
dc.language.iso | en | |
dc.publisher | © 2022 The Authors | |
dc.source.uri | https://doi.org/10.48550/arXiv.2203.15764 | * |
dc.title | 10 Problems for Partitions of Triangle-free Graphs | |
dc.type | Preprint | |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | a1d8f5ab-9124-4104-981c-8ba1e426e3ff | |
relation.isOrgUnitOfPublication | 82295b2b-0f85-4929-9659-075c93e82c48 |
File
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- 2022-Lidicky-ProblemsPartitionsPreprint.pdf
- Size:
- 350.29 KB
- Format:
- Adobe Portable Document Format
- Description: