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 123578
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.
3
votes
2
answers
542
views
An upper bound for the number of non-isomorphic graphs having exactly $m$ edges and no isola...
I asked this question in stackexchange a few days back (https://math.stackexchange.com/questions/2741806/bounding-the-number-of-non-isomorphic-graphs-having-m-edges-and-no-isolated-ve?noredirect=1#com …
- 367
1
vote
0
answers
63
views
Limit of $\alpha n$-regular graphs
I have a quick question about a graph limit problem. If I have a sequence of dense $d_n$-regular graphs on $n$ vertices (assume that $\frac{d_n}{n} \rightarrow \alpha > 0$), what is the limiting graph …
- 367
7
votes
1
answer
199
views
A Question on Graph Limits
I have a somewhat technical question about the concept of graph limits:
Suppose that $G_n$ is a sequence of labelled, simple, unweighted graphs, and let $W_n$ denote the graphon of $G_n$ (i.e. $W_n(x …
- 367