Skip to main content
SpringerLink
Log in

Subgraphs of Random Match-Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A simple graph (match-graph) generated by two-cycles of a general model of a random digraph is considered. Based on relations between a special case of such a graph and a classical model of a random graph, some results about the existence and the number of subgraphs of a given type in a random match-graph are presented.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland. e-mail:jaworski , , , , , , PL

    Jerzy Jaworski

  2. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland. e-mail:palka@math.amu.edu.pl, , , , , , PL

    Zbigniew Palka

Authors
  1. Jerzy Jaworski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zbigniew Palka
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 8, 1997 Final version received: September 16, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaworski, J., Palka, Z. Subgraphs of Random Match-Graphs. Graphs Comb 17, 255–264 (2001). https://doi.org/10.1007/s003730170039

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170039

Keywords

Search

Navigation