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 graph-theory
Search options not deleted
user 11183
Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.
0
votes
Partition of $\mathbb{F}_2^n$?
The answer to this question turns out to be negative i.e. in general it is not possible to partition the space $\mathbb{F}_2^n$ such that each partition has that property.
Consider the graph on $\mat …
- 121
2
votes
2
answers
233
views
Partition of $\mathbb{F}_2^n$?
Consider an undirected graph $G$ with $n$ nodes denoted by $i$, $i \in [n] = \{1,2,...,n\}$. Denote the set of neighbours of node $i$ in the graph by $N(i)$.
Given that there exists a set $\mathcal{I …
- 121