Publication

Independence numbers of polyhedral graphs

Riccardo Walter Maffucci, Sébastien Yann Gaspoz
2023
Journal Articles

Abstract

A polyhedral graph is a 3-connected planar graph. We find the least possible order p(k, a) of a polyhedral graph containing a k-independent set of size a for all positive integers k and a. In the case k =1 and a even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Independence numbers of polyhedral graphs

Chat with Graph Search

Asynchronous Speedup in Decentralized Optimization

A full characterization of invariant embeddability of unimodular planar graphs

Beyond Spectral Gap: The Role of the Topology in Decentralized Learning