Repeated Degrees in Random Uniform Hypergraphs

We prove that in a random $3$-uniform or $4$-uniform hypergraph of order $n$ the probability that some two vertices have the same degree tends to one as $n\to\infty$. [PUBLICATION ABSTRACT]

Saved in:
Bibliographic Details
Published in:SIAM journal on discrete mathematics 2013-01, Vol.27 (1), p.145-154
Main Authors: Balister, Paul, Bollobas, Bela, Lehel, Jeno, Morayne, Michal
Format: Article
Language:English
Subjects:
Applied mathematics
Central limit theorem
Graphs
Mathematical analysis
Random variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that in a random $3$-uniform or $4$-uniform hypergraph of order $n$ the probability that some two vertices have the same degree tends to one as $n\to\infty$. [PUBLICATION ABSTRACT]
ISSN:0895-4801
1095-7146
DOI:10.1137/100785156