The vertex Turán density in 3-ary \(n\)-cubes
From MaRDI portal
Publication:2078847
DOI10.1016/j.dam.2022.01.015zbMath1483.05083OpenAlexW4210862792MaRDI QIDQ2078847
Publication date: 4 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.015
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Enumeration in graph theory (05C30)
Cites Work
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Vertex Turán problems in the hypercube
- An extremal theorem in the hypercube
- Bounding the size of square-free subgraphs of the hypercube
- Some Turán type results on the hypercube
- Subcube fault-tolerance in hypercubes
- On extremal problems of graphs and generalized graphs
- On the structure of linear graphs
- Hexagon-free subgraphs of hypercubes
- Subgraphs of a hypercube containing no small even cycles
- On the maximum number of edges in a c4‐free subgraph of qn
- Turán’s Theorem in the Hypercube
- On even-cycle-free subgraphs of the hypercube
- Unnamed Item
- Unnamed Item
This page was built for publication: The vertex Turán density in 3-ary \(n\)-cubes