6

Answers
votes newest views recent
14
What to do when your research runs into a computationally challenging problem?
6
Triangulations coming from a poset. Or: What conditions are necessary and sufficient for a finite simplicial complex to be the order complex of a poset?
2
Visualizing large posets
2
“incidental” intersections of a complete graph in the plane
1
Number of edges in low complexity graphs
2
Number of spanning subgraphs of $K_n$ with given number of edges and connected components