Maximum density of vertex-induced perfect cycles and paths in the hypercube

DOI10.1016/J.DISC.2021.112585zbMath1472.05083arXiv2009.09037OpenAlexW3195662707MaRDI QIDQ1981712

John L. Goldwasser, Ryan Hansen

Publication date: 6 September 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.09037

zbMATH Keywords

hypercubeinducibilityperfect cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (1)

Inducibility in the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Turán \(H\)-densities for 3-graphs
• A note on the inducibility of 4-vertex graphs
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• On the maximum number of five-cycles in a triangle-free graph
• Inducibility of directed paths
• Vertex Turán problems in the hypercube
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• The maximal number of induced complete bipartite graphs
• The inducibility of graphs
• Polychromatic colorings on the hypercube
• On the number of pentagons in triangle-free graphs
• Long geodesics in subgraphs of the cube
• A note on short cycles in a hypercube
• Vertex Ramsey Problems in the Hypercube
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• On 14-Cycle-Free Subgraphs of the Hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Subgraphs of a hypercube containing no small even cycles
• The inducibility of complete bipartite graphs
• Edge-statistics on large graphs
• The Inducibility of Graphs on Four Vertices
• Turán’s Theorem in the Hypercube

This page was built for publication: Maximum density of vertex-induced perfect cycles and paths in the hypercube