68 search results - page 8 / 14 » ejc 2010 |
EJC
2010
13 years 10 months ago
2010
We invesitage the multiplicative loops of finite semifields. We show that the group generated by the left and right multiplication maps contains the special linear group. This resu...
EJC
2010
13 years 10 months ago
2010
We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v...
EJC
2010
13 years 10 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
EJC
2010
13 years 10 months ago
2010
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
EJC
2010
13 years 10 months ago
2010
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...