Largest Component in Random Combinatorial Structures

Discrete Mathematics - Netherlands
doi 10.1016/s0012-365x(97)00115-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Random Combinatorial Structures: The Convergent Case

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2005English

Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph

Publications of the Research Institute for Mathematical Sciences
Mathematics
2012English

The Largest Component in Critical Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Hopf Algebras of Combinatorial Structures

Canadian Journal of Mathematics
Mathematics
1993English

The Size of the Largest Components in Random Planar Maps

SIAM Journal on Discrete Mathematics
Mathematics
1999English

An Empirical Comparison of Combinatorial Testing, Random Testing and Adaptive Random Testing

IEEE Transactions on Software Engineering
Software
2020English

Combinatorial Structures and Group Invariant Partitions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Component Evolution in General Random Intersection Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Decomposable Combinatorial Structures With Restricted Patterns

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy