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 discrete-geometry
Search options not deleted
user 148974
Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.
1
vote
1
answer
87
views
Is there any known upper bound for the local crossing number of a graph drawing in the plane?
The local crossing number ${\rm LCR(G)}$ of a graph $G$ is defined as the least nonnegative integer $k$ such that the graph has a $k$-planar drawing. In other words, it is the smallest possible number …
- 1,190
2
votes
1
answer
127
views
The density of a tripartite 1-planar graph
1-planar graphs are those can be drawn in the plane so that there is at most one crossing per edge. We know that the maximum number of edges of an $n$-vertex 1-planar graph is at most $4n-8$, and the …
- 1,190
1
vote
Accepted
The density of a tripartite 1-planar graph
I find the following source. The known bound is 3.5n-7 (Theorem 4.8, pp. 57).
https://www.springer.com/gp/book/9789811565328
Beyond Planar Graphs
Communications of NII Shonan Meetings
Editors: Hong, S …
- 1,190
4
votes
Is it possible that every edge in a 1-planar drawing with minimum number of crossings is cro...
Concerning the above answer, I do not quite agree with the last sentence. Why is there some vertex of $D^\times$ outside $O$ if $y$ is a dummy vertex on $C$?
I draw a figure, where $y$ is a dummy vert …
- 1,190