Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,569,037 papers from all fields of science
Search
Sign In
Create Free Account
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing is a peer-reviewed scientific journal in mathematics published by Cambridge University Press. Its editor-in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Angel problem
Bruce Reed (mathematician)
Chromatic polynomial
Current Contents
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2012
2012
Polyhedral Embeddings of Snarks with Arbitrary Nonorientable Genera
Wenzhong Liu
,
Yichao Chen
Electronic Journal of Combinatorics
2012
Corpus ID: 6996601
Mohar and Vodopivec [Combinatorics, Probability and Computing (2006) 15, 877-893] proved that for every integer $k$ ($k \geq 1…
Expand
2011
2011
Compression progressive et tatouage conjoint de maillages surfaciques avec attributs de couleur. (Progressive compression and joint compression and watermarking of surface mesh with color attributes)
Ho Lee
2011
Corpus ID: 29102808
L’utilisation des modeles 3D, representes sous forme de maillage, est sans cesse croissante dans de nombreuses applications. Pour…
Expand
2010
2010
Pegging Graphs Yields a Small Diameter
S. Gerke
,
A. Steger
,
N. Wormald
Combinatorics, probability & computing
2010
Corpus ID: 38045201
We consider the following process for generating large random cubic graphs. Starting with a given graph, repeatedly add edges…
Expand
2010
2010
A Bijective Proof of a Theorem of Knuth
H. Bidkhori
,
S. Kishore
Combinatorics, probability & computing
2010
Corpus ID: 206296526
The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967…
Expand
2009
2009
Distribution of Random Variables on the Symmetric Group
V. Zacharovas
2009
Corpus ID: 115169089
The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally…
Expand
2008
2008
The Hitting Time for the Height of a Random Recursive Tree
Thomas M. Lewis
Combinatorics, probability & computing
2008
Corpus ID: 40601205
In this paper we provide a simple formula for the expected time for a random recursive tree to grow to a given height.
2007
2007
On the likely number of stable marriages
Craig T. Lennon
2007
Corpus ID: 185196589
An instance of a size n stable marriage problem involves n men and n women, each individually ranking all members of opposite sex…
Expand
2005
2005
Improved Results for Competitive Group Testing
Jens Schlaghoff
,
E. Triesch
Combinatorics, probability & computing
2005
Corpus ID: 20308886
We consider algorithms for group testing problems when nothing is known in advance about the number of defectives. Du and Hwang…
Expand
2003
2003
The Oberwolfach Meeting on Combinatorics, Probability and Computing
B. Bollobás
,
I. Wegener
Combinatorics, probability & computing
2003
Corpus ID: 33156485
This special issue is devoted to papers from the meeting on Combinatorics, Probability and Computing, held at the Mathematisches…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required