Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:519211
Jump to:navigation, search

DOI10.1007/s10255-016-0606-5zbMath1358.05254OpenAlexW2527029434MaRDI QIDQ519211

Hao Li, Ai Lian Chen, Fu Ji 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

minimum degreedegree distributionmaximum degreerandom uniform hypergraphs


Mathematics Subject Classification ID

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




Cites Work

  • Unnamed Item
  • Unnamed Item
  • The distribution of the maximum degree of a random graph
  • Degree sequences of random graphs
  • On the chromatic index of almost all graphs
  • Graph Theory and Probability
  • Vertices of given degree in a random graph
  • On the Asymptotic Behavior of Degrees of Vertices in a Random Graph


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:519211&oldid=12405904"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki