Match-Gaphs of Random Digraphs

  • Jerzy Jaworski
  • Zbigniew Palka
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)


We present some results devoted to the existence, numbers and orders of strong connected clusters and cliques in random digraphs and their match-graphs. These results may provide an interesting sociological interpretation.


Random Graph Exact Formula Threshold Function Factorial Moment Complete Subgraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. BOLLOBÉIS, B., (1985): Random Graphs, Academic Press Inc. (London) Ltd.Google Scholar
  2. BOLLOBAS, B. and ERDÖS, P. (1976): Cliques in Random Graphs. Math. Proc. Carob. Phil. Soc. 80, 419–427.Google Scholar
  3. JAWORSKI, J. and PALKA, Z., (1997): Subgraphs of Random Match-graphs. Submitted.Google Scholar
  4. JAWORSKI, J. and PALKA, Z., (1998): Remarks on a General Model of a Random Digraph. Submitted.Google Scholar
  5. JAWORSKI, J. and SMIT, I., (1987): On a Random Digraph. Annals of Discrete Math. 33, 111–127.Google Scholar
  6. PALKA, Z., RUCINSKI, A. and SPENCER, J., (1986): On a Method for Random Graphs. Discrete Math. 61, 253–258.Google Scholar
  7. SMIT, I., (1979): The Distribution of the Number of Two-cycles in Certain Kinds of Random Digraphs. Vrije Universiteit, Amsterdam, Rapport Nr 116 Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1999

Authors and Affiliations

  • Jerzy Jaworski
    • 1
  • Zbigniew Palka
    • 1
  1. 1.Department of Discrete MathematicsAdam Mickiewicz UniversityPoznańPoland

Personalised recommendations