On the Maximal Cut in a Random Hypergraph
This paper deals with the problem of finding the max-cut for random hypergraphs. We consider the classical binomial model of a random k -uniform hypergraph on n vertices with probability . The main results generalize previously known facts for the graph case and show that in the sparse case (when fo...
Gespeichert in:
| Veröffentlicht in: | Doklady. Mathematics 2021-11, Vol.104 (3), p.336-339 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | This paper deals with the problem of finding the max-cut for random hypergraphs. We consider the classical binomial model
of a random
k
-uniform hypergraph on
n
vertices with probability
. The main results generalize previously known facts for the graph case and show that in the sparse case (when
for some fixed
independent of
n
) there exists
such that the ratio of the maximal cut of
to the number of vertices converges in probability to
. Moreover, we obtain some bounds for the value of
. |
|---|---|
| ISSN: | 1064-5624 1531-8362 |
| DOI: | 10.1134/S1064562421060181 |