1,271 research outputs found

    A characterization and an application of weight-regular partitions of graphs

    Full text link
    A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex u∈Vu\in V a weight that equals the corresponding entry νu\nu_u of the Perron eigenvector ν\mathbf{\nu}. This paper contains three main results related to weight-regular partitions of a graph. The first is a characterization of weight-regular partitions in terms of double stochastic matrices. Inspired by a characterization of regular graphs by Hoffman, we also provide a new characterization of weight-regularity by using a Hoffman-like polynomial. As a corollary, we obtain Hoffman's result for regular graphs. In addition, we show an application of weight-regular partitions to study graphs that attain equality in the classical Hoffman's lower bound for the chromatic number of a graph, and we show that weight-regularity provides a condition under which Hoffman's bound can be improved

    Estimation of means in graphical Gaussian models with symmetries

    Full text link
    We study the problem of estimability of means in undirected graphical Gaussian models with symmetry restrictions represented by a colored graph. Following on from previous studies, we partition the variables into sets of vertices whose corresponding means are restricted to being identical. We find a necessary and sufficient condition on the partition to ensure equality between the maximum likelihood and least-squares estimators of the mean.Comment: Published in at http://dx.doi.org/10.1214/12-AOS991 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

    5-Chromatic Strongly Regular Graphs

    Get PDF
    In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5.Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph.For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic.In this way, we deal completely with 34 of these parameter sets using eigenvalue techniques and computer enumerations.graphs;eigenvalues

    Semi-algebraic colorings of complete graphs

    Get PDF
    We consider mm-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The case m=2m = 2 was first studied by Alon et al., who applied this framework to obtain surprisingly strong Ramsey-type results for intersection graphs of geometric objects and for other graphs arising in computational geometry. Considering larger values of mm is relevant, e.g., to problems concerning the number of distinct distances determined by a point set. For p≥3p\ge 3 and m≥2m\ge 2, the classical Ramsey number R(p;m)R(p;m) is the smallest positive integer nn such that any mm-coloring of the edges of KnK_n, the complete graph on nn vertices, contains a monochromatic KpK_p. It is a longstanding open problem that goes back to Schur (1916) to decide whether R(p;m)=2O(m)R(p;m)=2^{O(m)}, for a fixed pp. We prove that this is true if each color class is defined semi-algebraically with bounded complexity. The order of magnitude of this bound is tight. Our proof is based on the Cutting Lemma of Chazelle {\em et al.}, and on a Szemer\'edi-type regularity lemma for multicolored semi-algebraic graphs, which is of independent interest. The same technique is used to address the semi-algebraic variant of a more general Ramsey-type problem of Erd\H{o}s and Shelah
    • …
    corecore