Skip to main content
Log in

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

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In this paper we consider the random r-uniform r-partite hypergraph model H(n 1, n 2, ···, n r; n, p) which consists of all the r-uniform r-partite hypergraphs with vertex partition {V 1, V 2, ···, V r} where |V i| = n i = n i(n) (1 ≤ i ≤ r) are positive integer-valued functions on n with n 1 +n 2 +···+n r = n, and each r-subset containing exactly one element in V i (1 ≤ ir) is chosen to be a hyperedge of H pH (n 1, n 2, ···, n r; n, p) with probability p = p(n), all choices being independent. Let

$${\Delta _{{V_1}}} = {\Delta _{{V_1}}}\left( H \right)$$

and

$${\delta _{{V_1}}} = {\delta _{{V_1}}}\left( H \right)$$

be the maximum and minimum degree of vertices in V 1 of H, respectively;

$${X_{d,{V_1}}} = {X_{d,{V_1}}}\left( H \right),{Y_{d,{V_1}}} = {Y_{d,{V_1}}}\left( H \right)$$

,

$${Z_{d,{V_1}}} = {Z_{d,{V_1}}}\left( H \right)and{Z_{c,d,{V_1}}} = {Z_{c,d,{V_1}}}\left( H \right)$$

be the number of vertices in V 1 of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H(n 1, n 2, ···, n r; n, p),

$${X_{d,{V_1}}},{Y_{d,{V_1}}},{Z_{d,{V_1}}}and{Z_{c,d,{V_1}}}$$

all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D(n) such that in the space H(n 1, n 2, ···, n r; n, p),

$$\mathop {\lim }\limits_{n \to \infty } P\left( {{\Delta _{{V_1}}} = D\left( n \right)} \right) = 1$$

? What is the range of p such that a.e., H pH (n 1, n 2, ···, n r; n, p) has a unique vertex in V 1 with degree

$${\Delta _{{V_1}}}\left( {{H_p}} \right)$$

? Both answers are p = o (log n 1/N), where

$$N = \mathop \prod \limits_{i = 2}^r {n_i}$$

. The corresponding problems on

$${\delta _{{V_i}}}\left( {{H_p}} \right)$$

also are considered, and we obtained the answers are p ≤ (1 + o(1))(log n 1/N) and p = o (log n 1/N), respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bollobás, B. The distribution of the maximum degree of a random graph. Discrete Mathematics, 32: 201–203 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bollobás, B. Degree sequences of random graphs. Discrete Mathematics, 33: 1–19 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bollobás, B. Vertices of given degree in a random graph. Journal of Graph Theory, 6: 147–155 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bollobás, B. Random graphs (2nd). Cambridge University Press, Cambridge, 2001

    Book  MATH  Google Scholar 

  5. Erdös, P. Graph theory and probability. Canad. J. Math., 11: 34–38 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  6. Erdös, P., Wilson, R.J. On the chromatic index of almost all graphs. Journal of Combinatorial Theory B, 23: 255–257 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feller, W. An introduction to probability theory and its applications, Vols. I and II.John Wiley and Sons, New York, London, Sydney, 1966

    MATH  Google Scholar 

  8. Ivchenko, G.I. On the asymptotic behavior of the degrees of vertices in a random graph. Theory of Probability and its Applications, 18: 188–195 (1973)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ai-lian Chen.

Additional information

Supported in part by the National Natural Science Foundation of China under Grant No. 11401102, 11271307 and 11101086, Fuzhou university of Science and Technology Development Fund No. 2014-XQ-29.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Al., Li, H. & Zhang, Fj. The maximum and minimum degree of the random r-uniform r-partite hypergraphs. Acta Math. Appl. Sin. Engl. Ser. 32, 867–874 (2016). https://doi.org/10.1007/s10255-016-0606-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-016-0606-5

Keywords

2000 MR Subject Classification

Navigation