A large dihedral symmetry of the set of alternating sign matrices.
Wieland, Benjamin (2000)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The quantifier semigroup for bipartite graphs.”
A large dihedral symmetry of the set of alternating sign matrices.
Maxmaxflow and counting subgraphs.
Jackson, Bill, Sokal, Alan D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of fully packed loop configurations with a fixed associated matching.
Caselli, F., Krattenthaler, C., Lass, B., Nadeau, P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Product and puzzle formulae for Belkale-Kumar coefficients.
Knutson, Allen, Purbhoo, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Percolation of arbitrary words on the close-packed graph of .
Kesten, H., Sidoravicius, V., Zhang, Y. (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Graphical condensation, overlapping Pfaffians and superpositions of matchings.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Saturation Number for the Length of Degree Monotone Paths
Yair Caro, Josef Lauri, Christina Zarb (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G). This parameter, inspired by the well-known Erdős- Szekeres theorem, has been studied by the authors in two earlier papers. Here we consider a saturation problem for the parameter mp(G). We call G saturated if, for every edge e added to G, mp(G...
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recognizing cluster algebras of finite type.
Seven, Ahmet I. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Positively curved combinatorial 3-manifolds.
Trout, Aaron (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost all words are seen in critical site percolation on the triangular lattice.
Kesten, H., Sidoravicius, V., Zhang, Y. (1998)
Electronic Journal of Probability [electronic only]
Similarity:
Disjoint triangles and quadrilaterals in a graph
Hong Wang (2008)
Open Mathematics
Similarity:
Let n, s and t be three integers with s ≥ 1, t ≥ 0 and n = 3s + 4t. Let G be a graph of order n such that the minimum degree of G is at least (n + s)/2. Then G contains a 2-factor with s + t components such that s of them are triangles and t of them are quadrilaterals.