Extremal numbers for cycles in a hypercube
From MaRDI portal
Publication:6069141
DOI10.1016/j.dam.2023.07.021zbMath1526.05067arXiv2211.12842OpenAlexW4385517601MaRDI QIDQ6069141
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12842
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- An extremal theorem in the hypercube
- Bounding the size of square-free subgraphs of the hypercube
- Some Turán type results on the hypercube
- Cycles of even length in graphs
- On extremal problems of graphs and generalized graphs
- A note on short cycles in a hypercube
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Hexagon-free subgraphs of hypercubes
- A Ramsey-type result for the hypercube
- Subgraphs of a hypercube containing no small even cycles
- Turán’s Theorem in the Hypercube
- On even-cycle-free subgraphs of the hypercube
- On even-cycle-free subgraphs of the hypercube
This page was built for publication: Extremal numbers for cycles in a hypercube