Maximum density of vertex-induced perfect cycles and paths in the hypercube
Open Access
- 19 August 2021
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (11) , 112585
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- On the maximum number of five-cycles in a triangle-free graphJournal of Combinatorial Theory, Series B, 2012
- Vertex Turán problems in the hypercubeJournal of Combinatorial Theory, Series A, 2010
- Bounding the size of square-free subgraphs of the hypercubeDiscrete Mathematics, 2009
- Turán’s Theorem in the HypercubeSIAM Journal on Discrete Mathematics, 2007
- A note on short cycles in a hypercubeDiscrete Mathematics, 2006
- A Ramsey-type result for the hypercubeJournal of Graph Theory, 2006
- Hexagon‐free subgraphs of hypercubesJournal of Graph Theory, 1993
- Largest induced subgraphs of the n-cube that contain no 4-cyclesJournal of Combinatorial Theory, Series B, 1989
- The maximal number of induced complete bipartite graphsDiscrete Mathematics, 1986
- The inducibility of graphsJournal of Combinatorial Theory, Series B, 1975