A Random Graph With a Subcritical Number of Edges

Transactions of the American Mathematical Society - United States
doi 10.2307/2001158
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF a FIXED GRAPH IN a RANDOM D-Regular GRAPH

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2014English

The Minimum Number of Edges and Vertices in a Graph With Edge Connectivity $N$ and $M$ $N$-Bonds

Bulletin of the American Mathematical Society
1974English

A Large Deviation Result on the Number of Small Subgraphs of a Random Graph

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2001English

A Local Structure Graph Model: Modeling Formation of Network Edges as a Function of Other Edges

Political Analysis
SociologyInternational RelationsPolitical Science
2019English

Graph-Theoretic Bound on Number of A.C.I.M. For Random Transformation

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1992English

Graph Based Semi-Supervised Learning With Sharper Edges

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Comparison of Roman Domination Number With Domination Number, Independent Domination Number and Chromatic Number of a Graph

International Journal for Research in Applied Science and Engineering Technology
2019English

The Chromatic Number of the Complementary Graph to a Simple Graph Associated With a Commutative Ring

Arabian Journal of Mathematics
Mathematics
2014English

The Bounds on Poisson Approximation of the Number of Isolated Vertices in a Random Intersection Graph

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy