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 2559
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
0
answers
180
views
Coloring Cartesian Products with Constraints
Let $X$ and $Y$ be finite sets, and let $T_X$ (resp. $T_Y$) be a subset of the power set of $X$ (resp. of $Y$). (I think of the elements of $T_X$ as the tolerable subsets of $X$.)
A strict $(T_X,T_Y …
- 723
5
votes
Inequality of the number of integer partitions
No, he probably means exactly what he said. That is the way the partition function is usually defined. But either way, the answer is no.
If $q(k,n)$ counts partitions of n into integers no bigger t …
- 723
4
votes
Has this notion of product of graphs been studied?
An observation I made since posting, which may or may not be on the right track.
Let ${\cal A}_n$ be the "free group on $n$ involutions'', that is $\langle x_1,x_2,\ldots,x_n\rangle/\langle x_1^2,x_2 …
- 723
19
votes
6
answers
2k
views
Has this notion of product of graphs been studied?
Let $n\geq 2$ be a positive integer. For the purposes of this definition, let a colored graph be a finite undirected graph in which each edge is colored with one of $n$ colors so that no vertex is inc …
- 723