10 problems for partitions of triangle-free graphs

DOI10.1016/J.EJC.2023.103841zbMATH Open1548.05264MaRDI QIDQ6612517

Felix Christian Clemen, József Balogh, Bernard Lidický

Publication date: 30 September 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

balanced 2-partition with fewest class-edgesvertex \(k\)-partition of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisections of graphs
• Sparse halves in dense triangle-free graphs
• Maximizing proper colorings on graphs
• How to make a graph bipartite
• Making a \(K_4\)-free graph bipartite
• A local density condition for triangles
• Some old and new problems in various branches of combinatorics
• The local density of triangle-free graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• On the edge distribution in triangle-free graphs
• Sparse halves in triangle-free graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• More about sparse halves in triangle-free graphs
• Problems and results on judicious partitions
• Local Density in Graphs with Forbidden Subgraphs
• Flag algebras
• The RPR2 rounding technique for semidefinite programs
• Sparse halves in K4‐free graphs
• K4$K_4$‐free graphs have sparse halves

This page was built for publication: 10 problems for partitions of triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612517)