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 90655
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
1
answer
844
views
New edge coloring problem in graph theory
Let $G$ be a simple graph. Consider the following edge coloring:
We are allowed to use repetitive colors on some edges incident to a vertex such that the result does not contain a sequence of length …
CommunityBot
- 1
2
votes
0
answers
284
views
Does this idea give an algorithm for constructing Hadamard matrices?
Fedor Petrov's answer of my preceding question shows that my question reduces to the famous Hadamard conjecture about Hadamard matrices of order $4k$. So I decided to study this conjecture and I got …
- 13.4k
1
vote
1
answer
152
views
Edges of every simple graph can be colored with at most $s+1$ color
This question is related to my previous post: New edge coloring problem in graph theory.
Added: Let $G$ be a simple graph. Consider the following edge coloring:
We are allowed to use repetitive co …
- 30.1k