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 34180
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.
4
votes
Linear algebra proofs in combinatorics?
Here are some examples where the dimension of a vector space of polynomials is used to solve a combinatorial problem.
Theorem 1 There are at most $n(n+1)/2$ equiangular lines in $\mathbb{R}^n$.
Proof. …
- 33.8k
4
votes
What are the applications of hypergraphs?
Every finite geometry (projective planes, generalized polygons, polar spaces, near polygons, etc.) and every block design (Witt design, difference sets, Steiner triple systems, etc.) is a hypergraph. …
- 12.9k
2
votes
Are bipartite Moore graphs Hamiltonian?
This recent paper of Sato and Suzuki shows that the graphs corresponding to some classical generalized quadrangles are indeed Hamiltonian:
Sato, H. & Suzuki, H. Graphs and Combinatorics (2018). http …
- 1,197
1
vote
Graduate Schools for Graph Theory
Here's my (incomplete) list of recommendations based on my current knowledge of graph theory research.
General: Rutgers, UCSD, Tel Aviv, Waterloo, McGill, Princeton, Yale, Eötvös Loránd University, …
- 1,197
1
vote
Mclaughlin Graph
Here is some code for generating these graphs in SAGE
gap('LoadPackage("design")')
McL = graphs.McLaughlinGraph()
D = designs.projective_plane(4)
flags = [(x,B) for x in D.points() for B in D.blocks …
- 1,197