On hypergraph Turán problems with bounded matching number

IF 1 3区数学 Q1 MATHEMATICS

European Journal of Combinatorics Pub Date : 2025-03-26 DOI:10.1016/j.ejc.2025.104155

Dániel Gerbner , Casey Tompkins , Junpeng Zhou

引用次数: 0

Abstract

Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in

n

-vertex

F

-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results.

查看原文本刊更多论文

关于有界匹配数超图Turán问题

最近，Alon和Frankl以及Gerbner分别研究了有界匹配数的n顶点无f图的最大边数。我们考虑了匹配数有界的超图上的类似Turán问题，得到了一些精确的结果。

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

求助全文

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

来源期刊

European Journal of Combinatorics 数学-数学

CiteScore

2.10

自引率

10.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.