Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
{"title":"Edge-minimum saturated \n \n k\n -planar drawings","authors":"Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt","doi":"10.1002/jgt.23097","DOIUrl":null,"url":null,"abstract":"<p>For a class <span></span><math>\n \n <mrow>\n <mi>D</mi>\n </mrow></math> of drawings of loopless (multi-)graphs in the plane, a drawing <span></span><math>\n \n <mrow>\n <mi>D</mi>\n \n <mo>∈</mo>\n \n <mi>D</mi>\n </mrow></math> is <i>saturated</i> when the addition of any edge to <span></span><math>\n \n <mrow>\n <mi>D</mi>\n </mrow></math> results in <span></span><math>\n \n <mrow>\n <msup>\n <mi>D</mi>\n \n <mo>′</mo>\n </msup>\n \n <mo>∉</mo>\n \n <mi>D</mi>\n </mrow></math>—this is analogous to saturated graphs in a graph class as introduced by Turán and Erdős, Hajnal, and Moon. We focus on <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math>-planar drawings, that is, graphs drawn in the plane where each edge is crossed at most <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math> times, and the classes <span></span><math>\n \n <mrow>\n <mi>D</mi>\n </mrow></math> of all <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math>-planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math>-planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all <span></span><math>\n \n <mrow>\n <mi>n</mi>\n </mrow></math>-vertex saturated <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math>-planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest <span></span><math>\n \n <mrow>\n <mi>n</mi>\n </mrow></math>-vertex saturated <span></span><math>\n \n <mrow>\n <mi>k</mi>\n </mrow></math>-planar drawings have <span></span><math>\n \n <mrow>\n <mfrac>\n <mn>2</mn>\n \n <mrow>\n <mi>k</mi>\n \n <mo>−</mo>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>k</mi>\n <mspace></mspace>\n \n <mi>mod</mi>\n <mspace></mspace>\n \n <mn>2</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mfrac>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>n</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow></math> edges for any <span></span><math>\n \n <mrow>\n <mi>k</mi>\n \n <mo>≥</mo>\n \n <mn>4</mn>\n </mrow></math>, while if all that is forbidden, the sparsest such drawings have <span></span><math>\n \n <mrow>\n <mfrac>\n <mrow>\n <mn>2</mn>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>k</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n \n <mrow>\n <mi>k</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>k</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mfrac>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>n</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow></math> edges for any <span></span><math>\n \n <mrow>\n <mi>k</mi>\n \n <mo>≥</mo>\n \n <mn>6</mn>\n </mrow></math>.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"106 4","pages":"741-762"},"PeriodicalIF":0.9000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23097","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23097","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For a class of drawings of loopless (multi-)graphs in the plane, a drawing is saturated when the addition of any edge to results in —this is analogous to saturated graphs in a graph class as introduced by Turán and Erdős, Hajnal, and Moon. We focus on -planar drawings, that is, graphs drawn in the plane where each edge is crossed at most times, and the classes of all -planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated -planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all -vertex saturated -planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest -vertex saturated -planar drawings have edges for any , while if all that is forbidden, the sparsest such drawings have edges for any .
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .