The following pages link to Sergei L. Bezrukov (Q187114):
Displaying 50 items.
- (Q587220) (redirect page) (← links)
- (Q596080) (redirect page) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- A new approach to Macaulay posets (Q598449) (← links)
- (Q689965) (redirect page) (← links)
- On edge numberings of the \(n\)-cube graph (Q689968) (← links)
- (Q861790) (redirect page) (← links)
- Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
- On partitioning of hypergraphs (Q879389) (← links)
- (Q955023) (redirect page) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- Optimal labellings of rooted directed trees (Q1271877) (← links)
- Complement of a graph: a generalization (Q1272536) (← links)
- On posets whose products are Macaulay (Q1273668) (← links)
- A Kruskal-Katona type theorem for the linear lattice (Q1283308) (← links)
- The bandwidth of the complement of a \(k\)-tree (Q1288223) (← links)
- Characterizations of bipartite Steinhaus graphs (Q1297427) (← links)
- On clique-gated graphs (Q1297444) (← links)
- On an equivalence in discrete extremal problems (Q1301649) (← links)
- A new characterization of strongly chordal graphs (Q1301851) (← links)
- On \(k\)-partitioning of Hamming graphs (Q1302152) (← links)
- Partitioning the \(n\)-cube into sets with mutual distance 1 (Q1312006) (← links)
- Two extremal problems for oriented lattices (Q1320671) (← links)
- General edge-isoperimetric inequalities. I: Information-theoretical methods (Q1357262) (← links)
- On representing faces of a cube by subfaces (Q1368664) (← links)
- The vulnerability of the diameter of folded \(n\)-cubes (Q1377783) (← links)
- (Q1382387) (redirect page) (← links)
- Shadows and isoperimetry under the sequence-subsequence relation (Q1382388) (← links)
- An Erdős-Ko-Rado theorem for signed sets (Q1388967) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- A note on labeling of graphs (Q1393033) (← links)
- On \(L(d,1)\)-labelings of graphs (Q1567607) (← links)
- Every tree is 3-equitable (Q1567631) (← links)
- Explicit semisymmetric chain decomposition of the partition lattice (Q1567679) (← links)
- An edge-isoperimetric problem for powers of the Petersen graph (Q1575084) (← links)
- Voting fairly: Transitive maximal intersecting families of sets (Q1584664) (← links)
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs (Q1586354) (← links)
- Recognizing random intersection graphs (Q1587611) (← links)
- (Q1704591) (redirect page) (← links)
- New infinite family of regular edge-isoperimetric graphs (Q1704594) (← links)
- A local-global principle for vertex-isoperimetric problems (Q1850014) (← links)
- On the maximum size of \((p,Q)\)-free families (Q1850020) (← links)
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size (Q1867287) (← links)
- Disjointly representing set systems (Q1873809) (← links)
- Covering by intersecting families (Q1881681) (← links)
- Edge-isoperimetric problems for Cartesian powers of regular graphs (Q1885043) (← links)
- Edge isoperimetric theorems for integer point arrays (Q1893693) (← links)
- On two set-systems with restricted cross-intersections (Q1902973) (← links)
- A splitting property of maximal antichains (Q1906844) (← links)
- On tree-partitions of graphs (Q1910567) (← links)
