4,917 research outputs found

    Triangle-Intersecting Families of Graphs

    Full text link
    A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of graphs on a fixed set of n vertices are those obtained by fixing a specific triangle and taking all graphs containing it, resulting in a family of size (1/8) 2^{n choose 2}. We prove this conjecture and some generalizations (for example, we prove that the same is true of odd-cycle-intersecting families, and we obtain best possible bounds on the size of the family under different, not necessarily uniform, measures). We also obtain stability results, showing that almost-largest triangle-intersecting families have approximately the same structure.Comment: 43 page

    Random graphs containing arbitrary distributions of subgraphs

    Full text link
    Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly non-tree-like neighborhoods that contain short loops, cliques, or other biconnected subgraphs. In this paper we propose and analyze a new class of random graph models that incorporates general subgraphs, allowing for non-tree-like neighborhoods while still remaining solvable for many fundamental network properties. Among other things we give solutions for the size of the giant component, the position of the phase transition at which the giant component appears, and percolation properties for both site and bond percolation on networks generated by the model.Comment: 12 pages, 6 figures, 1 tabl

    The typical structure of maximal triangle-free graphs

    Get PDF
    Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most 2n2/8+o(n2)2^{n^2/8+o(n^2)} nn-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the typical structure of maximal triangle-free graphs. We show that almost every maximal triangle-free graph GG admits a vertex partition XYX\cup Y such that G[X]G[X] is a perfect matching and YY is an independent set. Our proof uses the Ruzsa-Szemer\'{e}di removal lemma, the Erd\H{o}s-Simonovits stability theorem, and recent results of Balogh-Morris-Samotij and Saxton-Thomason on characterization of the structure of independent sets in hypergraphs. The proof also relies on a new bound on the number of maximal independent sets in triangle-free graphs with many vertex-disjoint P3P_3's, which is of independent interest.Comment: 17 page

    Letter graphs and geometric grid classes of permutations: characterization and recognition

    Full text link
    In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive way, a polynomial-time recognition of geometric grid classes of permutations and kk-letter graphs for a fixed kk. However, constructive algorithms are available only for k=2k=2. In this paper, we present the first constructive polynomial-time algorithm for the recognition of 33-letter graphs. It is based on a structural characterization of graphs in this class.Comment: arXiv admin note: text overlap with arXiv:1108.6319 by other author

    On edge-sets of bicliques in graphs

    Full text link
    A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-sets of all bicliques. We characterize graphs whose edge-biclique hypergraph is conformal (i.e., it is the clique hypergraph of its 2-section) by means of a single forbidden induced obstruction, the triangular prism. Using this result, we characterize graphs whose edge-biclique hypergraph is Helly and provide a polynomial time recognition algorithm. We further study a hereditary version of this property and show that it also admits polynomial time recognition, and, in fact, is characterized by a finite set of forbidden induced subgraphs. We conclude by describing some interesting properties of the 2-section graph of the edge-biclique hypergraph.Comment: This version corrects an error in Theorem 11 found after the paper went into prin
    corecore