110,475 research outputs found
A Brouwer fixed point theorem for graph endomorphisms
We prove a Lefschetz formula for general simple graphs which equates the
Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of
simplices in G which are fixed by T. The degree i(x) of x with respect to T is
defined as a graded sign of the permutation T induces on the simplex x
multiplied by -1 if the dimension of x is odd. The Lefschetz number is defined
as in the continuum as the super trace of T induced on cohomology. In the
special case where T is the identity, the formula becomes the Euler-Poincare
formula equating combinatorial and cohomological Euler characteristic. The
theorem assures in general that if L(T) is nonzero, then T has a fixed clique.
A special case is a discrete Brouwer fixed point theorem for graphs: if T is a
graph endomorphism of a connected graph G, which is star-shaped in the sense
that only the zeroth cohomology group is nontrivial, like for connected trees
or triangularizations of star shaped Euclidean domains, then there is clique x
which is fixed by T. Unlike in the continuum, the fixed point theorem proven
here looks for fixed cliques, complete subgraphs which play now the role of
"points" in the graph. Fixed points can so be vertices, edges, fixed triangles
etc. If A denotes the automorphism group of a graph, we also look at the
average Lefschetz number L(G) which is the average of L(T) over A. We prove
that this is the Euler characteristic of the graph G/A and especially an
integer. We also show that as a consequence of the Lefschetz formula, the zeta
function zeta(T,z) is a product of two dynamical zeta functions and therefore
has an analytic continuation as a rational function which is explicitly given
by a product formula involving only the dimension and the signature of prime
orbits of simplices in G.Comment: 24 pages, 6 figure
Threshold phenomena involving the connected components of random graphs and digraphs
We consider some models of random graphs and directed graphs and investigate their behavior near thresholds for the appearance of certain types of connected components. Firstly, we look at the critical window for the appearance of a giant strongly connected component in binomial random digraphs. We provide bounds on the probability that the largest strongly connected component is very large or very small. Next, we study the configuration model for graphs and show new upper bounds on the size of the largest connected component in the subcritical and barely subcritical regimes. We also show that these bounds are tight in some instances. Finally we look at the configuration model for random digraphs. We investigate the barely sub-critical region and show that this model behaves similarly to the binomial random digraph whose barely sub- and super-critical behaviour was studied by Luczak and Seierstad. Moreover, we show the existence of a threshold for the existence of a giant weak component, as predicted by Kryven.En aquesta tesi considerem diversos models de grafs i graf dirigits aleatoris, i investiguem el seu comportament a prop dels llindars per l'aparició de certs tipus de components connexes. En primer lloc, estudiem la finestra crÃtica per a l'aparició d'una component fortament connexa en dÃgrafs aleatoris binomials (o d'Erdos-Rényi). En particular, provem diversos resultats sobre la probabilitat lÃmit que la component fortament connexa sigui sigui molt gran o molt petita. A continuació, estudiem el model de configuració per a grafs no dirigits i mostrem noves cotes superiors per la mida de la component connexa més gran en els règims sub-crÃtics i quasi-subcrÃtics. També demostrem que, en general, aquestes cotes no poden ser millorades. Finalment, estudiem el model de configuració per a dÃgrafs aleatoris. Ens centrem en la regió quasi-subcrÃtica i demostrem que aquest model es comporta de manera similar al model binomial, el comportament del qual va ser estudiat per Luczak i Seierstad en les regions quasi-subcrÃtica i quasi-supercrÃtica. A més a més, demostrem l'existència d'una funció llindar per a l'existència d'una component feble gegant, tal com va predir Kryven.Postprint (published version
On the super connectivity of Kronecker products of graphs
In this paper we present the super connectivity of Kronecker product of a
general graph and a complete graph.Comment: 8 page
- …