Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1903.08232

Maximizing 2-Independent Sets in 3-Uniform Hypergraphs

Lauren Keough·A. J. Radcliffe
View original source ↗Read source document ↗Export metadata ↓

Abstract

There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the Kruskal-Katona theorem that the lex graph has the maximum number of independent sets in a graph of fixed size and order. In this paper we solve two equivalent problems. The first is: what $3$-uniform hypergraph on a ground set of size $n$, having at least $t$ edges, has the most $2$-independent sets? Here a $2$--independent set is a subset of vertices containing fewer than $2$ vertices from each edge. This is equivalent to the problem of determining which graph on $n$ vertices having at least $t$ triangles has the most independent sets. The (hypergraph) answer is that, ignoring some transient and some persistent exceptions, a $(2,3,1)$-lex style $3$-graph is optimal. We also discuss the problem of maximizing the number of $s$-independent sets in $r$-uniform hypergraphs of fixed size and order, proving some simple results, and conjecture an asymptotically correct general solution to the problem.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lauren Keough, A. J. Radcliffe. 2019-03-19. Maximizing 2-Independent Sets in 3-Uniform Hypergraphs. https://arxiv.org/abs/1903.08232

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗