3 papers
math.CO2024
Saturated Partial Embeddings of Maximal Planar Graphs
Alexander Clifton, Dániel G. Simon
We investigate two notions of saturation for partial planar embeddings of maximal planar graphs. Let be a vertex-labeled maximal planar graph on vertices, which…
math.CO2024
Subgraphs of random graphs in hereditary families
Alexander Clifton, Hong Liu, Letícia Mattos +1
For a graph and a hereditary property , let denote the maximum number of edges of a subgraph of that belongs to . We pr…
math.CO2024
Saturated Partial Embeddings of Planar Graphs
Alexander Clifton, Nika Salia
In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph , we say that a plane subgraph is a \textit…