On the maximal cut in a random hypergraph

DOI10.1134/S1064562421060181zbMath1486.05283MaRDI QIDQ2121837

P. A. Zakharov, Dmitriy A. Shabanov

Publication date: 5 April 2022

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphsoptimization probleminterpolation methodrandom hypergraphscut of hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Semidefinite programming (90C22) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating the \(r\)-colorability threshold for a random hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph
• On the weak chromatic number of random hypergraphs
• Extremal cuts of sparse random graphs
• Panchromatic 3-colorings of random hypergraphs
• On the max‐cut of sparse random graphs
• Random MAX SAT, random MAX CUT, and their phase transitions
• Hypergraph coloring up to condensation
• Rigid Colorings of Hypergraphs and Contiguity
• Two-Colorings of a Random Hypergraph
• MAX k‐CUT and approximating the chromatic number of random graphs
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

This page was built for publication: On the maximal cut in a random hypergraph