Matrix-free proof of a regularity characterization.
Czygrinow, A., Nagle, B. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A simple algorithm for constructing Szemerédi's regularity partition.”
Matrix-free proof of a regularity characterization.
Image partition regularity over the reals.
Hindman, Neil (2003)
The New York Journal of Mathematics [electronic only]
Similarity:
Image partition regularity over the integers, rationals and reals.
Hindman, Neil, Strauss, Dona (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
Universally image partition regularity.
De, Dibyendu, Paul, Ram Krishna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A characterization for sparse -regular pairs.
Gerke, Stefanie, Steger, Angelika (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Partition regular systems of linear inequalities.
Schäffler, Meike (1998)
Documenta Mathematica
Similarity:
Regular character tables of symmetric groups.
Olsson, Jørn B. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -walk-regular graphs.
Dalfó, C., Fiol, M.A., Garriga, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.
Coolsaet, K., Degraer, J. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Shuffle algorithm for two-dimensional singular systems with a Fornasini-Marchesini model
Gerson Beauchamp, Frank L. Lewis (1991)
Kybernetika
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: