Search references for THRACKLE. Phrases containing THRACKLE
See searches and references containing THRACKLE!THRACKLE
Graph drawn with all edges intersecting
A thrackle is an embedding of a graph in the plane in which each edge is a Jordan arc and every pair of edges meet exactly once. Edges may either meet
Thrackle
Measure method in computational geometry
all antipodal pairs; the set of all pairs, viewed as a graph, forms a thrackle. The method of rotating calipers can be interpreted as the projective dual
Rotating_calipers
a complete graph with the same chromatic number Conway's thrackle conjecture that thrackles cannot have more edges than vertices The GNRS conjecture on
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
On existence of a strongly regular graph
of Identifying Integer Sequences. Other problems in the set include the thrackle conjecture, the minimum spacing of Danzer sets, and the question of who
Conway's_99-graph_problem
Graph with at most one cycle per component
a thrackle (a graph drawn so that every pair of edges has one point of intersection) is also a thrackle, so Conway's conjecture that every thrackle has
Pseudoforest
English mathematician (1937–2020)
The Conway knot is named after him. Conway's conjecture that, in any thrackle, the number of edges is at most equal to the number of vertices, is still
John_Horton_Conway
game resembling peg solitaire Conway's thrackle conjecture – In graph theory, the conjecture that no thrackle has more edges than vertices Alexander–Conway
List of things named after John Horton Conway
List_of_things_named_after_John_Horton_Conway
Collatz 1440 Cramér's conjecture number theory Harald Cramér 32 Conway's thrackle conjecture graph theory John Horton Conway 150 Deligne conjecture monodromy
List_of_conjectures
common interior point at which the two edges properly cross. Conway's thrackle conjecture can now be reformulated as follows: A simple topological graph
Topological_graph
Mathematical game
Conway's 99-graph problem, the minimum spacing of Danzer sets, and the thrackle conjecture. Guy, Richard K. (1976). "Twenty questions concerning Conway's
Sylver_coinage
Upper bound on intersecting set families
maximum intersecting families here) all pairs have equal intersections Thrackle, an unsolved problem on the size of families of intersecting curves Das
Erdős–Ko–Rado_theorem
Set of points touching all convex bodies of unit volume
including Conway's 99-graph problem, the analysis of sylver coinage, and the thrackle conjecture. Heilbronn triangle problem, on sets of points that do not form
Danzer_set
2018 mathematics book by Marcus Schaefer
that cross an odd number of times. The final chapter of part II concerns thrackles and the problem of finding drawings with a maximum number of crossings
Crossing_Numbers_of_Graphs
Special n-gon that has the largest area among all diameter-one n-gons
involved a case analysis of all possible n {\displaystyle n} -vertex thrackles with straight edges. The full conjecture of Graham, characterizing the
Biggest_little_polygon
THRACKLE
THRACKLE
THRACKLE
THRACKLE
THRACKLE
THRACKLE
THRACKLE
THRACKLE
THRACKLE