Large cuts in hypergraphs via energy

DOI10.1017/S0305004125000362MaRDI QIDQ6970147zbMATH OpenFDO

Authors Eero Räty, István Tomon

Publication date 18 June 2025

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0305004125000362

zbMATH Keywords

\(r\)-uniform hypergraphsrandom cuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Bipartite subgraphs
• scientific article; zbMATH DE number 3124239 (Why is no real title available?)
• scientific article; zbMATH DE number 3715594 (Why is no real title available?)
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• Hypergraph cuts above the average
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Inapproximability results for set splitting and satisfiability problems with no mixed clauses
• Judicious partitions and related problems
• Matrix discrepancy and the log-rank conjecture
• MaxCut in ${\bm H)$-Free Graphs
• New results for MaxCut in H$H$‐free graphs
• On coloring graphs to maximize the proportion of multicolored k-edges
• On MaxCut and the Lov\'asz theta function
• Quadratic forms on graphs
• Some Extremal Properties of Bipartite Subgraphs
• Some optimal inapproximability results

Cited in

(2)

• Factorization norms and an inverse theorem for MaxCut
• MaxCut in graphs with sparse neighborhoods

This page was built for publication: Large cuts in hypergraphs via energy

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