Largest induced subgraphs of the n-cube that contain no 4-cycles
From MaRDI portal
Publication:580365
DOI10.1016/0095-8956(89)90054-3zbMath0626.05029OpenAlexW1998015472MaRDI QIDQ580365
Karen Anne Johnson, Roger Entringer
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90054-3
Related Items (24)
PASCALIAN RECTANGLES MODULOm ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Vertex Turán problems for the oriented hypercube ⋮ Inducibility in the hypercube ⋮ New optimal covering arrays using an orderly algorithm ⋮ Structures and lower bounds for binary covering arrays ⋮ Constructions of covering arrays of strength five ⋮ On 14-Cycle-Free Subgraphs of the Hypercube ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ Vertex Turán problems in the hypercube ⋮ Randomized post-optimization of covering arrays ⋮ New covering array numbers ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Recursive fault-tolerance of Fibonacci cube in hypercubes ⋮ Mixed covering arrays of strength three with few factors ⋮ A construction of variable strength covering arrays ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Bounding the size of square-free subgraphs of the hypercube ⋮ Daisies and Other Turán Problems ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Some Turán type results on the hypercube
Cites Work
This page was built for publication: Largest induced subgraphs of the n-cube that contain no 4-cycles
