An Ordering on the Even Discrete Torus
From MaRDI portal
Publication:4388982
DOI10.1137/S0895480194278234zbMATH Open0914.05038OpenAlexW2064462071MaRDI QIDQ4388982FDOQ4388982
Authors: Oliver Riordan 
Publication date: 11 May 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480194278234
Recommendations
- On Todorcevic orderings
- A continuous approach to discrete ordering on \(\mathbb{S}^2\)
- Enumeration in torus arrangements
- Toric partial orders
- On the ordered conjecture
- scientific article; zbMATH DE number 3483195
- Orderability and the Weinstein conjecture
- On the Turán number of some ordered even cycles
- Toeplitz order
- On sphere orders
Extremal problems in graph theory (05C35) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cited In (18)
- Planar lattice subsets with minimal vertex boundary
- Homomorphisms from the torus
- Bandwidth and pathwidth of three-dimensional grids
- A problem of Shapozenko on Johnson graphs
- Tunneling behavior of Ising and Potts models in the low-temperature regime
- Toeplitz order
- On Todorcevic orderings
- On the extremal enumeration of \(\mathbb Z_n^2\)
- The isoperimetric number of \(d\)-dimensional \(k\)-ary arrays
- The edge-isoperimetric problem for discrete tori
- Concentration on the discrete torus using transportation
- Eliminating Cycles in the Discrete Torus
- Security number of grid-like graphs
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- The sub-Gaussian constant and concentration inequalities
- Dominating sequences in grid-like and toroidal graphs
- A general method to determine limiting optimal shapes for edge-isoperimetric inequalities
- The vertex isoperimetric problem for the powers of the diamond graph
This page was built for publication: An Ordering on the Even Discrete Torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388982)
