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 7016
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
1
answer
324
views
Intersection graphs for "conflicting" directed paths in trees
Given an undirected tree and a set of directed paths in this tree (or equivalently, ordered $s$–$t$ pairs), we construct a graph with the paths as vertices and an edge between two paths if they traver …
- 171
1
vote
1
answer
108
views
Is the graph of a thresholded correlation matrix chordal?
Given vectors $V$ of length $d$, construct a graph $G = (V, E)$ where $\{u, v\} \in E$ iff the Pearson correlation between $u$ and $v$ is larger than some threshold $t > 0$. Is $G$ chordal? It seems l …
- 171
-1
votes
A decision problem in graph coloring
It is NP-hard, since you can reduce the standard graph coloring problem to this problem by adding a sufficient number of degree-0 vertices.
- 171
14
votes
Non-isomorphic graphs of given order.
The nauty software contains the "geng" program, which enumerates all nonisomorphic graphs of a given order, or only connected ones, or selected on a wide range of other criteria. The method is tuned f …
- 171