Pages that link to "Item:Q580365"
From MaRDI portal
The following pages link to Largest induced subgraphs of the n-cube that contain no 4-cycles (Q580365):
Displaying 24 items.
- Structures and lower bounds for binary covering arrays (Q449145) (← links)
- Constructions of covering arrays of strength five (Q663479) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Vertex Turán problems in the hypercube (Q965224) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Bounding the size of square-free subgraphs of the hypercube (Q1024494) (← links)
- Some Turán type results on the hypercube (Q1043648) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Maximum density of vertex-induced perfect cycles and paths in the hypercube (Q1981712) (← links)
- New covering array numbers (Q2010732) (← links)
- A construction of variable strength covering arrays (Q2025162) (← links)
- The vertex Turán density in 3-ary \(n\)-cubes (Q2078847) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Recursive fault-tolerance of Fibonacci cube in hypercubes (Q2497470) (← links)
- Vertex Turán problems for the oriented hypercube (Q2667743) (← links)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- Daisies and Other Turán Problems (Q3103623) (← links)
- Suitable Permutations, Binary Covering Arrays, and Paley Matrices (Q3466746) (← links)
- On 14-Cycle-Free Subgraphs of the Hypercube (Q3552500) (← links)
- PASCALIAN RECTANGLES MODULO<i>m</i> (Q3984680) (← links)
- New optimal covering arrays using an orderly algorithm (Q4603878) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Inducibility in the hypercube (Q6199378) (← links)
