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.

查看原文本刊更多论文

求助全文

约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.