• Corpus ID: 119285022

A Note on the Maximum Rectilinear Crossing Number of Spiders

@article{Fallon2018ANO,
  title={A Note on the Maximum Rectilinear Crossing Number of Spiders},
  author={Joshua Fallon and Kirsten Hogenson and Lauren Keough and Mario Lomel'i and Marcus Schaefer and Pablo Sober'on},
  journal={arXiv: Combinatorics},
  year={2018}
}
The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three edges have an interior point in common, and edges do not contain vertices in their interior. A spider is a subdivision of $K_{1,k}$. We provide both upper and lower bounds for the maximum rectilinear crossing number of spiders. While there are not many results… 

Figures from this paper

References

SHOWING 1-10 OF 35 REFERENCES
The Maximum of the Maximum Rectilinear Crossing Numbers of d-Regular Graphs of Order n
TLDR
The generalized star drawings of the d-regular graphs S_{n,d} of order n prove that they maximize the maximum rectilinear crossing numbers and offer a simpler proof of two results initially proved by Furry and Kleitman as partial results in the direction of this conjecture.
On the Maximum Crossing Number
TLDR
This paper disproves the conjecture that any graph has a straight-line drawing, e.g., a drawing with vertices in convex position, that maximizes the number of edge crossings and strengthens results by showing hardness of approximation even for the unweighted geometric case and proving that the un Weighted topological case is NP-hard.
The Maximum Rectilinear Crossing Number of the n Dimensional Cube Graph
In this research we find and prove the maximum rectilinear crossing number of the three-dimensional cube graph (Q 3). We demonstrate a method of drawing the n-cube graph, Q n , with many crossings,
Thrackles: An Improved Upper Bound
TLDR
It is proved that any thrackle of n vertices has at most $1.3984n$ edges, and that the maximum number of edges of a quasi-thrackle on $n$ vertices is ${3\over 2}(n-1)$.
On the obfuscation complexity of planar graphs
  • O. Verbitsky
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2008
On Conway's thrackle conjecture
TLDR
It is shown that a thrackle has at most twice as many edges as vertices as it was conjectured that it cannot exceed the number of its vertices.
Introduction to Graph Theory
1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs. 2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration.
The Graph Crossing Number and its Variants: A Survey
TLDR
A survey of the rich variety of crossing number variants that have been introduced in the literature for purposes that range from studying the theoretical underpinnings of the crossing number to crossing minimization for visualization problems.
Crossing Number is NP-Complete
TLDR
This paper shows that there is not likely to be any efficient way to design an optimal embedding of a graph or network in a planar surface, and hence this problem is NP-complete.
...
1
2
3
4
...