Generalized Turán densities in the hypercube
From MaRDI portal
Publication:2099479
DOI10.1016/j.disc.2022.113238zbMath1504.05135arXiv2201.04598OpenAlexW4308312679MaRDI QIDQ2099479
Casey Tompkins, David Offner, Laurin Benz, Maria A. Axenovich
Publication date: 23 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04598
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum number of five-cycles in a triangle-free graph
- Additive approximation of generalized Turán questions
- Pentagons vs. triangles
- An extremal theorem in the hypercube
- Some Turán type results on the hypercube
- On the number of \(C_ 5's\) in a triangle-free graph
- Many cliques in \(H\)-free subgraphs of random graphs
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the number of pentagons in triangle-free graphs
- Some exact results for generalized Turán problems
- Generalized Turán problems for even cycles
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- The Maximum Number of Triangles in C2k+1-Free Graphs
- Hexagon-free subgraphs of hypercubes
- A Ramsey-type result for the hypercube
- Subgraphs of a hypercube containing no small even cycles
- On the maximum number of edges in a c4‐free subgraph of qn
- A note on the maximum number of triangles in a C5‐free graph
- A Generalized Turán Problem and its Applications
- A generalized Turán problem in random graphs
- Turán’s Theorem in the Hypercube
- On even-cycle-free subgraphs of the hypercube
- On even-cycle-free subgraphs of the hypercube
- Many \(T\) copies in \(H\)-free graphs
- Triangles in C5‐free graphs and hypergraphs of girth six
