Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 15706
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
1
answer
280
views
Number of 2-connected subsets in the hypercube
Let $Q_d$ be the d-dimensional hypercube - the graph with vertex set $\{0,1\}^d$ and edges joining two vertices that differ in exactly one coordinate. Say a subset $A$ of vertices is 2-connected if f …
- 11
0
votes
Probability of a Random Walk crossing a straight line
An upper estimate is given in Appendix A of "The Probabilistic Method" by Alon/Spencer. This gives $P(S_n > a) < e^{-a^2/2n}$ for $a > 0$ (Theorem A.1.1). There are lots of bounds like this one, if …
- 11