Turán problems for edge-ordered graphs

Gerbner Dániel,Methuku Abhishek,Nagy Dániel T.,Pálvölgyi Dömötör,Tardos Gábor,Vizer Máté

Journal of Combinatorial Theory, Series B（2023）

引用 3|浏览20

暂无评分

摘要

In this paper we initiate a systematic study of the Turán problem for edge-ordered graphs. A simple graph is called edge-ordered if its edges are linearly ordered. This notion allows us to study graphs (and in particular their maximum number of edges) when a subgraph is forbidden with a specific edge-order but the same underlying graph may appear with a different edge-order.

查看译文

关键词

Extremal combinatorics,Graph theory,Edge ordered graphs,Turán's theorem,Erdős-Stone-Simonovits theorem,Forbidden submatrices,Discrete geometry

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要