Affiliation:
1. Department of Mathematics University of Florida Gainesville Florida USA
Abstract
AbstractBecause connectivity is such a basic concept in graph theory, extremal problems concerning the average order of the connected induced subgraphs of a graph have been of notable interest. A particularly resistant open problem is whether or not, for a connected graph of order , all of whose vertices have degree at least 3, this average is at least . It is shown in this paper that if is a connected, vertex transitive graph, then the average order of the connected induced subgraphs of is at least .The extremal graph theory problems mentioned above lead to a broader theory. The concept of a Union‐Intersection System (UIS) is introduced, being a finite set of points and a set of subsets of called blocks satisfying the following simple property for all : if , then . To generalize results on the average order of a connected induced subgraph of a graph, it is conjectured that if a UIS is, in various senses, “connected and regular,” then the average size of a block is at least half the number of points. We prove that if a union‐intersection set system is regular, completely irreducible, and nonredundant, then the average size of a block is at least half the number of points.
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Connection and separation in hypergraphs;Bahmanian M. A.;Theory Appl. Graphs,2015
2. On the mean order of connected induced subgraphs of block graphs;Balodis K. J.;Australasian J. Combin,2020
3. A.Bretto Hypergraph theory an introduction Springer New York 2013.
4. The Journey of the Union-Closed Sets Conjecture
5. Subtrees of graphs