The maximum and minimum degree of the random r-uniform r-partite hypergraphs

DOI10.1007/S10255-016-0606-5MaRDI QIDQ519211zbMATH OpenOpenAlexFDO

Authors Hao Li, Ai Lian Chen, Fuji Zhang

Publication date 4 April 2017

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-016-0606-5

zbMATH Keywords

degree distributionmaximum degreeminimum degreerandom uniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The maximum and minimum degrees of random bipartite multigraphs
• Degree sequences of sufficiently dense random uniform hypergraphs
• On the decomposition of random hypergraphs
• Almost perfect matchings in random uniform hypergraphs
• Relative Turán problems for uniform hypergraphs

Cites work

• Degree sequences of random graphs
• Graph Theory and Probability
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• On the Asymptotic Behavior of Degrees of Vertices in a Random Graph
• On the chromatic index of almost all graphs
• Random graphs.
• The distribution of the maximum degree of a random graph
• Vertices of given degree in a random graph

Cited in

(3)

• Maximally connected \(p\)-partite uniform hypergraphs
• Cores of random \(r\)-partite hypergraphs
• The maximum and minimum degrees of random bipartite multigraphs

This page was built for publication: The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs

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