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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 8, 1997 Final version received: September 16, 1999
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s003730170039