Generalized Turán densities in the hypercube
Preprint
Abstract
A classical extremal, or Tur\'an-type problem asks to determine ${\rm ex}(G, H)$, the largest number of edges in a subgraph of a graph $G$ which does not contain a subgraph isomorphic to $H$. Alon and Shikhelman introduced the so-called generalized extremal number ${\rm ex}(G,T,H)$, defined to be the maximum number of subgraphs isomorphic to $T$ in a subgraph of $G$ that contains no subgraphs isomorphic to $H$. In this paper we investigate the case when $G = Q_n$, the hypercube of dimension $n$, and $T$ and $H$ are smaller hypercubes or cycles.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- -free subgraphs of dense graphs maximizing the number of cliques and their blow-upsDiscrete Mathematics, 2019
- Many T copies in H-free graphsJournal of Combinatorial Theory, Series B, 2016
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercubeEuropean Journal of Combinatorics, 2014
- On the number of pentagons in triangle-free graphsJournal of Combinatorial Theory, Series A, 2013
- On the maximum number of five-cycles in a triangle-free graphJournal of Combinatorial Theory, Series B, 2012
- On even-cycle-free subgraphs of the hypercubeJournal of Combinatorial Theory, Series A, 2011
- A Ramsey-type result for the hypercubeJournal of Graph Theory, 2006
- Hexagon‐free subgraphs of hypercubesJournal of Graph Theory, 1993
- Subgraphs of a hypercube containing no small even cyclesJournal of Graph Theory, 1992
- On the number ofC 5′S in a triangle-free graphCombinatorica, 1989