| |
1-10 of 31 reviews |
Date Reviewed | |
| |
New complete Latin squares of odd order
Ollis M. European Journal of Combinatorics 4135-46, 2014. Type: Article
A square grid of n symbols arranged in n rows and columns, such that each symbol appears once in each row and each column, is called a Latin square of order n. Such squares are o...
|
May 20 2015 |
|
| |
Representing finite convex geometries by relatively convex sets
Adaricheva K. European Journal of Combinatorics 3768-78, 2014. Type: Article
A set A with a closure operator c: 2A → 2A is called a convex geometry if the empty set is closed and if it satisfies the anti-...
|
Sep 10 2014 |
|
| |
 The Merino-Welsh conjecture holds for series-parallel graphs
Noble S., Royle G. European Journal of Combinatorics 3824-35, 2014. Type: Article
Orientation is an assignment of direction to each edge of an undirected graph. When none of the directed edges is in a cycle, the orientation is called acyclic. When every directed edge is in some cycle, the orientation is called total...
|
Aug 20 2014 |
|
| |
Characterization of some 4-gonal configurations of Ahrens-Szekeres type
Ghinelli D. European Journal of Combinatorics 33(7): 1557-1573, 2012. Type: Article
A finite generalized quadrangle is a point-line geometry characterized by the following property: for a point p and a line L, p not incident with L, there exis...
|
Jan 30 2013 |
|
| |
Odd permutations are nicer than even ones
Cori R., Marcus M., Schaeffer G. European Journal of Combinatorics 33(7): 1467-1478, 2012. Type: Article
The set of all permutations on a finite set of n elements forms a group, with the composition of the permutations as the group operation. A permutation can be considered as a bijection (one-to-one correspondence) fro...
|
Jan 8 2013 |
|
| |
Selfdual substitutions in dimension one
Berthé V., Frettlöh D., Sirvent V. European Journal of Combinatorics 33(6): 981-1000, 2012. Type: Article
In this rather lengthy paper, the authors focus on “several instances of the concept of substitutions: word substitutions, ... endomorphisms of the free group [on two generators], tile substitutions [on the real line], and du...
|
Sep 27 2012 |
|
| |
A conjecture on the number of SDRs of a (t,n)-family
He D., Lu C. European Journal of Combinatorics 33(1): 1-7, 2012. Type: Article
Given a family of sets, it is an interesting exercise to choose a distinct element from each set so that a meaningful pattern can emerge from the selection. Such problems arise, for example, in constructing Latin squares, and in the po...
|
Jul 9 2012 |
|
| |
Maximum size of a planar graph with given degree and even diameter
Tishchenko S. European Journal of Combinatorics 33(3): 380-396, 2012. Type: Article
The degree-diameter problem involves finding a possible graph G with the largest number of vertices p(Δ, D), where Δ is the maximum degree of G
|
May 31 2012 |
|
| |
The algebra of set functions I: the product theorem and duality
Lass B. European Journal of Combinatorics 33(2): 227-236, 2012. Type: Article
This is the first of a sequence of research reports that attempt to approach the topic of the algebra of set functions in a complete way, and to illustrate its practicality in (re-)defining and (re-)proving results that we might have m...
|
May 24 2012 |
|
| |
A systematic approach to matrix forms of the Pascal triangle: the twelve triangular matrix forms and relations
Birregah B., Doh P., Adjallah K. European Journal of Combinatorics 31(5): 1205-1216, 2010. Type: Article
This paper deals with a systematic investigation of Pascal matrices--matrix forms of the Pascal triangle whose elements are binomial coefficients. The authors propose that Pascal matrices are “mathematical objects in...
|
Sep 17 2010 |
|
| |
|
|
| |
|
|
|
|
