Add to ORKGIn this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest K_(r,s)-free subgraph one can guarantee in every graph G with m edges? We also discuss the analogous problem for hypergraphs
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
summary:Given a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of ...
summary:Given a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of ...
A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts of size at mo...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertic...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
summary:Given a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of ...
summary:Given a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of ...
A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts of size at mo...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertic...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...