Erdős–Hajnal Problem for H-Free Hypergraphs

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2023-12-28 DOI:10.1007/s00373-023-02737-6

Danila Cherkashin, Alexey Gordeev, Georgii Strukov

引用次数: 0

Abstract

This paper deals with the minimum number \(m_H(r)\) of edges in an H-free hypergraph with the chromatic number more than r. We show how bounds on Ramsey and Turán numbers imply bounds on \(m_H(r)\).

查看原文本刊更多论文

无 H 超图的 Erdős-Hajnal 问题

本文讨论了色度数大于 r 的无 H 超图中边的最小数量 \(m_H(r)\)。我们展示了拉姆齐数和图兰数的约束是如何暗示 \(m_H(r)\)的约束的。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.