Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices

Let q be a prime power and r=0,1...,q−3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices of projective planes and the incidence matrices of (q−r)-regular bipartite graphs of girth 6 and $q^2$−rq−1 vertices in each partite set. Moreover, in this work two Latin squares of order q−1 with entries belonging to {0,1,..., q}, not necessarily the same, are defined to be quasi row-disjoint if and only if the cartesian product of any two rows contains at most one pair (χ,χ) with χ≠0. Using these quasi row-disjoint Latin squares we find (q−1)-regular bipartite graphs of girth 6 with $q^2$−q−2 vertices in each partite set. Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth 6.Postprint (published version

An alternate description of a (q + 1; 8)-cage

Let q >= 2 be a prime power. In this note we present an alternate description of the known (q + 1; 8)-cages which has allowed us to construct small (k; g)–graphs for k =q, q-1, and g = 7; 8 in other papers on this same topic.Peer ReviewedPostprint (published version

Counterexamples to the classical central limit theorem for triplewise independent random variables having a common arbitrary margin

We present a general methodology to construct triplewise independent sequences of random variables having a common but arbitrary marginal distribution $F$ (satisfying very mild conditions). For two specific sequences, we obtain in closed form the asymptotic distribution of the sample mean. It is non-Gaussian (and depends on the specific choice of $F$). This allows us to illustrate the extent of the 'failure' of the classical central limit theorem (CLT) under triplewise independence. Our methodology is simple and can also be used to create, for any integer $K$, new $K$-tuplewise independent sequences that are not mutually independent. For $K \geq 4$, it appears that the sequences created using our methodology do verify a CLT, and we explain heuristically why this is the case.Comment: 15 pages, 5 figures, 1 tabl

Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices

Let q be a prime power and r=0,1...,q−3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices of projective planes and the incidence matrices of (q−r)-regular bipartite graphs of girth 6 and $q^2$−rq−1 vertices in each partite set. Moreover, in this work two Latin squares of order q−1 with entries belonging to {0,1,..., q}, not necessarily the same, are defined to be quasi row-disjoint if and only if the cartesian product of any two rows contains at most one pair (χ,χ) with χ≠0. Using these quasi row-disjoint Latin squares we find (q−1)-regular bipartite graphs of girth 6 with $q^2$−q−2 vertices in each partite set. Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth 6

On the structure of graphs without short cycles

The objective of this thesis is to study cages, constructions and properties of such families of graphs. For this, the study of graphs without short cycles plays a fundamental role in order to develop some knowledge on their structure, so we can later deal with the problems on cages. Cages were introduced by Tutte in 1947. In 1963, Erdös and Sachs proved that (k, g) -cages exist for any given values of k and g. Since then, large amount of research in cages has been devoted to their construction. In this work we study structural properties such as the connectivity, diameter, and degree regularity of graphs without short cycles. In some sense, connectivity is a measure of the reliability of a network. Two graphs with the same edge-connectivity, may be considered to have different reliabilities, as a more refined index than the edge-connectivity, edge-superconnectivity is proposed together with some other parameters called restricted connectivities. By relaxing the conditions that are imposed for the graphs to be cages, we can achieve more refined connectivity properties on these families and also we have an approach to structural properties of the family of graphs with more restrictions (i.e., the cages). Our aim, by studying such structural properties of cages is to get a deeper insight into their structure so we can attack the problem of their construction. By way of example, we studied a condition on the diameter in relation to the girth pair of a graph, and as a corollary we obtained a result guaranteeing restricted connectivity of a special family of graphs arising from geometry, such as polarity graphs. Also, we obtained a result proving the edge superconnectivity of semiregular cages. Based on these studies it was possible to develop the study of cages. Therefore obtaining a relevant result with respect to the connectivity of cages, that is, cages are k/2-connected. And also arising from the previous work on girth pairs we obtained constructions for girth pair cages that proves a bound conjectured by Harary and Kovács, relating the order of girth pair cages with the one for cages. Concerning the degree and the diameter, there is the concept of a Moore graph, it was introduced by Hoffman and Singleton after Edward F. Moore, who posed the question of describing and classifying these graphs. As well as having the maximum possible number of vertices for a given combination of degree and diameter, Moore graphs have the minimum possible number of vertices for a regular graph with given degree and girth. That is, any Moore graph is a cage. The formula for the number of vertices in a Moore graph can be generalized to allow a definition of Moore graphs with even girth (bipartite Moore graphs) as well as odd girth, and again these graphs are cages. Thus, Moore graphs give a lower bound for the order of cages, but they are known to exist only for very specific values of k, therefore it is interesting to study how far a cage is from this bound, this value is called the excess of a cage. We studied the excess of graphs and give a contribution, in the sense of the work of Biggs and Ito, relating the bipartition of girth 6 cages with their orders. Entire families of cages can be obtained from finite geometries, for example, the graphs of incidence of projective planes of order q a prime power, are (q+1, 6)-cages. Also by using other incidence structures such as the generalized quadrangles or generalized hexagons, it can be obtained families of cages of girths 8 and 12. In this thesis, we present a construction of an entire family of girth 7 cages that arises from some combinatorial properties of the incidence graphs of generalized quadrangles of order (q,q)