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 118450
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
0
answers
142
views
Random graph - probability threshold for any linear size set to contain a fixed clique
Let $t\geq 3$ and $0<\varepsilon<1$ be fixed. Denote by $K_t$ the clique on $t$ vertices, and by $G_{n,p}$ the binomial random graph.
Question:
Is the threshold for the probability that "every subset …
1
vote
Regular pseudographs
There is an article by Catherine Greenhill (UNSW Sydney) and Brendan McKay (ANU Canberra), Asymptotic enumeration of sparse multigraphs with given degrees
Theorem 1.1 yields a more general results, bu …
3
votes
1
answer
160
views
making a random uniform hypergraph linear
Let $\mathcal{H}_{n,p,h}=(V,E)$ be a random $h$-uniform hypergraph on $[n]$, sampled according to the usual binomial distribution. We known that with high probability, the number of edges in $\mathcal …
2
votes
Accepted
making a random uniform hypergraph linear
Note: in order to understand the proof, it was key (at least for me) to see that a cycle of length $t$ in a $k$-uniform hypergraph is set of $t$ edges $(e_1,\ldots,e_t)$ such that (viewing each edge a …
2
votes
1
answer
164
views
graph built from orthogonal Latin Squares
I've asked the following question on MathExchange site, with a bounty, with no answer or comments. Maybe I would have additional comments here. The problem came to be while reading some articles on fi …
4
votes
A 2-page paper on a lower bound of Ramsey number
The methodology you are looking for is referred as "cyclic Ramsey graphs", or "circulant coloring". You could also look at Distance Ramsey number, a generalization of circulant coloring.
In the 1983 a …