EuDML | Browse

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 6 of 6

Paths of specified length in random $k$ -partite graphs.

Subramanian, C.R. (2001)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Perfect matchings in $ε$ -regular graphs.

Alon, Noga, Rödl, Vojtěch, Ruciński, Andrzej (1998)

The Electronic Journal of Combinatorics [electronic only]

Perfectly balanced partitions of smoothed graphs.

Ben-Eliezer, Ido, Krivelevich, Michael (2009)

The Electronic Journal of Combinatorics [electronic only]

Planarity thresholds for two types of random subgraphs of the $n$ -cube

Karin Mahrhold, Karl F. E. Weber (1989)

Commentationes Mathematicae Universitatis Carolinae

Poisson convergence of numbers of vertices of a given degree in random graphs

Wojciech Kordecki (1996)

Discussiones Mathematicae Graph Theory

The asymptotic distributions of the number of vertices of a given degree in random graphs, where the probabilities of edges may not be the same, are given. Using the method of Poisson convergence, distributions in a general and particular cases (complete, almost regular and bipartite graphs) are obtained.

Processes on unimodular random networks.

Aldous, David J., Lyons, Russell (2007)

Electronic Journal of Probability [electronic only]

Currently displaying 1 – 6 of 6

Page 1