Inducibility in the hypercube

DOI10.1002/jgt.23053arXiv2209.04740OpenAlexW4388531695MaRDI QIDQ6199378

Ryan Hansen, John L. Goldwasser

Publication date: 23 February 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

hypercubedensityextremal graphinducibility

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• A note on the inducibility of 4-vertex graphs
• 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
• Triangles in a complete chromatic graph with three colors
• The maximal number of induced complete bipartite graphs
• The inducibility of graphs
• Polychromatic colorings on the hypercube
• Maximum density of vertex-induced perfect cycles and paths in the hypercube
• 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
• 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: Inducibility in the hypercube