Andrei Pavelescu

activity

20132026

most citedNew bounds on maximal linkless graphs

4 citations · 13 across the 14 of their papers we have counts for

collaborators

Showing math.COShow all

9 papers · 1 filter

math.CO2026

New minor minimal non-apex graphs

Andrei Pavelescu, Elena Pavelescu, Madeline Potter

A graph is apex if it becomes planar after the deletion of one vertex. The family of apex graphs is closed under taking minors, so it is characterized by a finite set of forbidden…

math.CO2024

Intrinsically knotted graphs and connected domination

Gregory Li, Andrei Pavelescu, Elena Pavelescu

We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination…

math.CO2022★ 1 cited

Complete Minors in Complements of Non-Separating Planar Graphs

Leonard Fowler, Gregory Li, Andrei Pavelescu

We prove that the complement of any non-separating planar graph of order $2 n - 3$ contains a $K_{n}$ minor, and argue that the order $2 n - 3$ is lowest possible with this property. To il…

math.CO2021

An infinite family of linklessly embeddable Tutte-4-connected graphs

Andrei Pavelescu, Elena Pavelescu

For each $n \geq 14$ , we provide an example of a linklessly embeddable, Tutte-4-connected graph of order $n$ .

math.CO2021★ 1 cited

Constructions stemming from non-separating planar graphs and their Colin de Verdière invariant

Andrei Pavelescu, Elena Pavelescu

A planar graph $G$ is said to be non-separating if there exists an embedding of $G$ in $R^{2}$ such that for any cycle $C \subset G$ , all vertices of $G\setminus \m…

math.CO2019

Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors

Ryan Odeneal, Andrei Pavelescu

We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.

math.CO2018★ 2 cited

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.

math.CO2018

Hadwiger numbers of self-complementary graphs

Andrei Pavelescu, Elena Pavelescu

The Hadwiger number of a graph $G$ , denoted by $h (G)$ , is the order of the largest complete minor of $G$ . A graph is said to be self-complementary if it is isomorphic to its comple…

math.CO2017★ 1 cited

Complete Minors of Self-Complementary Graphs

Andrei Pavelescu, Elena Pavelescu

We show that any self-complementary graph with $n$ vertices contains a $K_{⌊ \frac{n + 1}{2} ⌋}$ minor. We derive topological properties of self-complementary graphs.