Pages that link to "Item:Q1024494"
From MaRDI portal
The following pages link to Bounding the size of square-free subgraphs of the hypercube (Q1024494):
Displayed 17 items.
- On a covering problem in the hypercube (Q489361) (← links)
- Vertex Turán problems in the hypercube (Q965224) (← links)
- Some Turán type results on the hypercube (Q1043648) (← links)
- Maximum density of vertex-induced perfect cycles and paths in the hypercube (Q1981712) (← links)
- The vertex Turán density in 3-ary \(n\)-cubes (Q2078847) (← links)
- On even-cycle-free subgraphs of the doubled Johnson graphs (Q2242794) (← links)
- Extremal even-cycle-free subgraphs of the complete transposition graphs (Q2243230) (← links)
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes (Q2444570) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- Hypercube 1-factorizations from extended Hamming codes (Q2851530) (← links)
- On 14-Cycle-Free Subgraphs of the Hypercube (Q3552500) (← links)
- Component Edge Connectivity of Hypercubes (Q4963263) (← links)
- On even-cycle-free subgraphs of the hypercube (Q5891227) (← links)
- On even-cycle-free subgraphs of the hypercube (Q5892562) (← links)
- Extremal numbers for cycles in a hypercube (Q6069141) (← links)
- Random polynomial graphs for random Turán problems (Q6143381) (← links)
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets (Q6172311) (← links)