格伦鲍姆关于四临界平面图边缘密度问题的解答

IF 1 2区数学 Q1 MATHEMATICS

Combinatorica Pub Date : 2024-04-17 DOI:10.1007/s00493-024-00100-8

Zdeněk Dvořák, Carl Feghali

引用次数: 0

摘要

我们证明，在所有 4 临界平面图 G 上，\(\limsup |E(G)|/|V(G)| = 2.5\) 回答了格伦鲍姆在 1988 年提出的一个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs

查看原文本刊更多论文

Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs

We show that \(\limsup |E(G)|/|V(G)| = 2.5\) over all 4-critical planar graphs G, answering a question of Grünbaum from 1988.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.