Pages that link to "Item:Q1302164"
From MaRDI portal
The following pages link to On an isoperimetric problem for Hamming graphs (Q1302164):
Displaying 17 items.
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- Planar lattice subsets with minimal vertex boundary (Q820851) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- On the bandwidth of a Hamming graph (Q1400004) (← links)
- The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) (Q1658768) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
- On the variance of Shannon products of graphs (Q2462357) (← links)
- The sub-Gaussian constant and concentration inequalities (Q2472751) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Isoperimetric Problem and Meta-fibonacci Sequences (Q3511309) (← links)
- Isoperimetry in integer lattices (Q4645032) (← links)
- (Q5005125) (← links)
