1 citations · 1 across the 3 of their papers we have counts for
6 papers
The Extremal Function for Apex Graphs
Elena Pavelescu
McCarty and Thomas conjectured that a linklessly embeddable graph with vertices and triangles has at most edges. Thomas and Yoo proved this to be…
An infinite family of linklessly embeddable Tutte-4-connected graphs
Andrei Pavelescu, Elena Pavelescu
For each , we provide an example of a linklessly embeddable, Tutte-4-connected graph of order .
The complement of a nIL graph with thirteen vertices is IL
Andrei Pavelescu, Elena Pavelescu
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
Escher squares and lattice links
Ramin Naimi, Andrei Pavelescu, Elena Pavelescu
We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.
Hadwiger numbers of self-complementary graphs
Andrei Pavelescu, Elena Pavelescu
The Hadwiger number of a graph , denoted by , is the order of the largest complete minor of . A graph is said to be self-complementary if it is isomorphic to its comple…
On the number of links in a linearly embedded
Ramin Naimi, Elena Pavelescu
We show there exists a linear embedding of with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.