On the Turán number of the hypercube
From MaRDI portal
Publication:6193735
DOI10.1017/fms.2024.27arXiv2211.02015MaRDI QIDQ6193735
Benjamin Sudakov, Oliver Janzer
Publication date: 19 March 2024
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.02015
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short proofs of some extremal results. II.
- On a Turán type problem of Erdős
- The extremal graph problem of the icosahedron
- Rainbow Turán problem for even cycles
- More on the extremal number of subdivisions
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Finite reflection groups and graph norms
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Rainbow Turán Problems
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Supersaturation of even linear cycles in linear hypergraphs
- On the Extremal Number of Subdivisions
- The Extremal Number of Tight Cycles
- An extremal graph problem
- On the structure of linear graphs
- Graph norms and Sidorenko's conjecture
