2,438 research outputs found

    Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs

    Full text link
    The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that, in fact, every positive independence density of a countably infinite hypergraph with hyperedges of bounded size is equal to the independence density of some finite hypergraph whose hyperedges are no larger than those in the infinite hypergraph. This answers a question of Bonato, Brown, Kemkes, and Pra{\l}at about independence densities of graphs. Furthermore, we show that for any kk, the set of independence densities of hypergraphs with hyperedges of size at most kk is closed and contains no infinite increasing sequences.Comment: To appear in the European Journal of Combinatorics, 12 page

    Minimum-Weight Edge Discriminator in Hypergraphs

    Full text link
    In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph H=(V,E)\mathcal H=(\mathcal V, \mathcal E), a function λ:VZ+{0}\lambda: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\} is said to be an {\it edge-discriminator} on H\mathcal H if vEiλ(v)>0\sum_{v\in E_i}{\lambda(v)}>0, for all hyperedges EiEE_i\in \mathcal E, and vEiλ(v)vEjλ(v)\sum_{v\in E_i}{\lambda(v)}\ne \sum_{v\in E_j}{\lambda(v)}, for every two distinct hyperedges Ei,EjEE_i, E_j \in \mathcal E. An {\it optimal edge-discriminator} on H\mathcal H, to be denoted by λH\lambda_\mathcal H, is an edge-discriminator on H\mathcal H satisfying vVλH(v)=minλvVλ(v)\sum_{v\in \mathcal V}\lambda_\mathcal H (v)=\min_\lambda\sum_{v\in \mathcal V}{\lambda(v)}, where the minimum is taken over all edge-discriminators on H\mathcal H. We prove that any hypergraph H=(V,E)\mathcal H=(\mathcal V, \mathcal E), with E=n|\mathcal E|=n, satisfies vVλH(v)n(n+1)/2\sum_{v\in \mathcal V} \lambda_\mathcal H(v)\leq n(n+1)/2, and equality holds if and only if the elements of E\mathcal E are mutually disjoint. For rr-uniform hypergraphs H=(V,E)\mathcal H=(\mathcal V, \mathcal E), it follows from results on Sidon sequences that vVλH(v)Vr+1+o(Vr+1)\sum_{v\in \mathcal V}\lambda_{\mathcal H}(v)\leq |\mathcal V|^{r+1}+o(|\mathcal V|^{r+1}), and the bound is attained up to a constant factor by the complete rr-uniform hypergraph. Next, we construct optimal edge-discriminators for some special hypergraphs, which include paths, cycles, and complete rr-partite hypergraphs. Finally, we show that no optimal edge-discriminator on any hypergraph H=(V,E)\mathcal H=(\mathcal V, \mathcal E), with E=n(3)|\mathcal E|=n (\geq 3), satisfies vVλH(v)=n(n+1)/21\sum_{v\in \mathcal V} \lambda_\mathcal H (v)=n(n+1)/2-1, which, in turn, raises many other interesting combinatorial questions.Comment: 22 pages, 5 figure

    Automatic enumeration of regular objects

    Full text link
    We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial counting sequence and for asymptotic analysis. The key tool is the scalar product for symmetric functions and that this operation preserves D-finiteness.Comment: Corrected for readability; To appear in the Journal of Integer Sequence

    Hipergráfok = Hypergraphs

    Get PDF
    A projekt célkitűzéseit sikerült megvalósítani. A négy év során több mint száz kiváló eredmény született, amiből eddig 84 dolgozat jelent meg a téma legkiválóbb folyóirataiban, mint Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, stb. Számos régóta fennálló sejtést bebizonyítottunk, egész régi nyitott problémát megoldottunk hipergráfokkal kapcsolatban illetve kapcsolódó területeken. A problémák némelyike sok éve, olykor több évtizede nyitott volt. Nem egy közvetlen kutatási eredmény, de szintén bizonyos értékmérő, hogy a résztvevők egyike a Norvég Királyi Akadémia tagja lett és elnyerte a Steele díjat. | We managed to reach the goals of the project. We achieved more than one hundred excellent results, 84 of them appeared already in the most prestigious journals of the subject, like Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, etc. We proved several long standing conjectures, solved quite old open problems in the area of hypergraphs and related subjects. Some of the problems were open for many years, sometimes for decades. It is not a direct research result but kind of an evaluation too that a member of the team became a member of the Norvegian Royal Academy and won Steele Prize

    Packing random graphs and hypergraphs

    Full text link
    We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have different densities. In the graph case, we prove a stronger result, on packing a random graph with a fixed graph
    corecore