Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

2012 ◽  
Vol 72 (2) ◽  
pp. 220-245 ◽  
Author(s):  
Michael A. Henning ◽  
Anders Yeo
Keyword(s):  
Lower Bounds ◽  
Independent Sets

scholarly journals Linear syzygies of Stanley-Reisner ideals

2001 ◽  
Vol 89 (1) ◽  
pp. 117 ◽  
Author(s):  
V Reiner ◽  
V Welker
Keyword(s):  
Simplicial Complex ◽  
Lower Bounds ◽  
Monomial Ideal ◽  
Independent Sets ◽  
Free Resolution ◽  
Monomial Ideals ◽  
Minimal Free Resolution ◽  
Linear Syzygies ◽  
Alexander Dual ◽  
Syzygy Modules

We give an elementary description of the maps in the linear strand of the minimal free resolution of a square-free monomial ideal, that is, the Stanley-Reisner ideal associated to a simplicial complex $\Delta$. The description is in terms of the homology of the canonical Alexander dual complex $\Delta^*$. As applications we are able to prove for monomial ideals and $j=1$ a conjecture of J. Herzog giving lower bounds on the number of $i$-syzygies in the linear strand of $j^{th}$-syzygy modules show that the maps in the linear strand can be written using only $\pm 1$ coefficients if $\Delta^*$ is a pseudomanifold exhibit an example where multigraded maps in the linear strand cannot be written using only $\pm 1$ coefficients compute the entire resolution explicitly when $\Delta^*$ is the complex of independent sets of a matroid

scholarly journals Lower Bounds for Maximal Matchings and Maximal Independent Sets

2021 ◽  
Vol 68 (5) ◽  
pp. 1-30
Author(s):  
Alkida Balliu ◽  
Sebastian Brandt ◽  
Juho Hirvonen ◽  
Dennis Olivetti ◽  
Mikaël Rabie ◽  
...  
Keyword(s):  
Lower Bounds ◽  
Independent Set ◽  
Independent Sets ◽  
Deterministic Algorithm ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Maximal Independent Set ◽  
Maximal Matching ◽  
Maximal Independent Sets ◽  
Open Question

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O ( Δ + log * n ) communication rounds; here, n is the number of nodes and Δ is the maximum degree. The lower bound by Linial (1987, 1992) shows that the dependency on n is optimal: These problems cannot be solved in o (log * n ) rounds even if Δ = 2. However, the dependency on Δ is a long-standing open question, and there is currently an exponential gap between the upper and lower bounds. We prove that the upper bounds are tight. We show that any algorithm that finds a maximal matching or maximal independent set with probability at least 1-1/ n requires Ω (min { Δ , log log n / log log log n }) rounds in the LOCAL model of distributed computing. As a corollary, it follows that any deterministic algorithm that finds a maximal matching or maximal independent set requires Ω (min { Δ , log n / log log n }) rounds; this is an improvement over prior lower bounds also as a function of  n .

Strong vb-dominating and vb-independent sets of a graph

2019 ◽  
Vol 12 (01) ◽  
pp. 2050002 ◽  
Author(s):  
Sayinath Udupa ◽  
R. S. Bhat
Keyword(s):  
Lower Bounds ◽  
Dominating Set ◽  
Independence Number ◽  
Domination Number ◽  
Independent Set ◽  
Independent Sets ◽  
Upper And Lower Bounds ◽  
Number Formula

Let [Formula: see text] be a graph. A vertex [Formula: see text] strongly (weakly) b-dominates block [Formula: see text] if [Formula: see text] ([Formula: see text]) for every vertex [Formula: see text] in the block [Formula: see text]. A set [Formula: see text] is said to be strong (weak) vb-dominating set (SVBD-set) (WVBD-set) if every block in [Formula: see text] is strongly (weakly) b-dominated by some vertex in [Formula: see text]. The strong (weak) vb-domination number [Formula: see text] ([Formula: see text]) is the order of a minimum SVBD (WVBD) set of [Formula: see text]. A set [Formula: see text] is said to be strong (weak) vertex block independent set (SVBI-set (WVBI-set)) if [Formula: see text] is a vertex block independent set and for every vertex [Formula: see text] and every block [Formula: see text] incident on [Formula: see text], there exists a vertex [Formula: see text] in the block [Formula: see text] such that [Formula: see text] ([Formula: see text]). The strong (weak) vb-independence number [Formula: see text] ([Formula: see text]) is the cardinality of a maximum strong (weak) vertex block independent set (SVBI-set) (WVBI-set) of [Formula: see text]. In this paper, we investigate some relationships between these four parameters. Several upper and lower bounds are established. In addition, we characterize the graphs attaining some of the bounds.

scholarly journals New Computational Upper Bounds for Ramsey Numbers $R(3,k)$

10.37236/2824 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Jan Goedgebeur ◽  
Stanisław P. Radziszowski
Keyword(s):  
Lower Bounds ◽  
Independent Sets ◽  
Upper Bounds ◽  
Computational Techniques ◽  
Free Graph ◽  
Ramsey Numbers ◽  
Critical Graph ◽  
Minimum Number

Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: $R(3,10) \le 42$, $R(3,11) \le 50$, $R(3,13) \le 68$, $R(3,14) \le 77$, $R(3,15) \le 87$, and $R(3,16) \le 98$. All of them are improvements by one over the previously best known bounds. Let $e(3,k,n)$ denote the minimum number of edges in any triangle-free graph on $n$ vertices without independent sets of order $k$. The new upper bounds on $R(3,k)$ are obtained by completing the computation of the exact values of $e(3,k,n)$ for all $n$ with $k \leq 9$ and for all $n \leq 33$ for $k = 10$, and by establishing new lower bounds on $e(3,k,n)$ for most of the open cases for $10 \le k \le 15$. The enumeration of all graphs witnessing the values of $e(3,k,n)$ is completed for all cases with $k \le 9$. We prove that the known critical graph for $R(3,9)$ on 35 vertices is unique up to isomorphism. For the case of $R(3,10)$, first we establish that $R(3,10)=43$ if and only if $e(3,10,42)=189$, or equivalently, that if $R(3,10)=43$ then every critical graph is regular of degree 9. Then, using computations, we disprove the existence of the latter, and thus show that $R(3,10) \le 42$.

scholarly journals Lower Bounds for Maximal Matchings and Maximal Independent Sets

2019 ◽  
Author(s):  
Alkida Balliu ◽  
Sebastian Brandt ◽  
Juho Hirvonen ◽  
Dennis Olivetti ◽  
Mikael Rabie ◽  
...  
Keyword(s):  
Lower Bounds ◽  
Independent Sets ◽  
Maximal Independent Sets

scholarly journals Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

2007 ◽  
Vol 155 (2) ◽  
pp. 119-136 ◽  
Author(s):  
Ioannis Caragiannis ◽  
Aleksei V. Fishkin ◽  
Christos Kaklamanis ◽  
Evi Papaioannou
Keyword(s):  
Lower Bounds ◽  
Independent Sets ◽  
On Line

scholarly journals Ramsey-type theorems for lines in 3-space

2016 ◽  
Vol Vol. 18 no. 3 (Combinatorics) ◽  
Author(s):  
Jean Cardinal ◽  
Michael S. Payne ◽  
Noam Solomon
Keyword(s):  
Lower Bounds ◽  
Polynomial Time ◽  
General Position ◽  
Independent Set ◽  
Independent Sets ◽  
Intersection Graph ◽  
Sparse Graphs ◽  
Polynomial Time Algorithms ◽  
Ramsey Type ◽  
Point Line

We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli in 3-space. Among other things, we prove that: (1) The intersection graph of n lines in R^3 has a clique or independent set of size Omega(n^{1/3}). (2) Every set of n lines in R^3 has a subset of n^{1/2} lines that are all stabbed by one line, or a subset of Omega((n/log n)^{1/5}) such that no 6-subset is stabbed by one line. (3) Every set of n lines in general position in R^3 has a subset of Omega(n^{2/3}) lines that all lie on a regulus, or a subset of Omega(n^{1/3}) lines such that no 4-subset is contained in a regulus. The proofs of these statements all follow from geometric incidence bounds -- such as the Guth-Katz bound on point-line incidences in R^3 -- combined with Tur\'an-type results on independent sets in sparse graphs and hypergraphs. Although similar Ramsey-type statements can be proved using existing generic algebraic frameworks, the lower bounds we get are much larger than what can be obtained with these methods. The proofs directly yield polynomial-time algorithms for finding subsets of the claimed size. Comment: 18 pages including appendix

scholarly journals Counting Independent Sets in Hypergraphs

2014 ◽  
Vol 23 (4) ◽  
pp. 539-550 ◽  
Author(s):  
JEFF COOPER ◽  
KUNAL DUTTA ◽  
DHRUV MUBAYI
Keyword(s):  
Recent Result ◽  
Lower Bounds ◽  
Independent Set ◽  
Independent Sets ◽  
Average Degree ◽  
General Statement ◽  
Free Graph ◽  
Hereditary Properties ◽  
Image Position ◽  
Linear Hypergraph

Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least ${\exp\biggl({1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t} \biggl(\frac{1}{2}\ln t-1\biggr)\biggr)}$ independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n → ∞, every triangle-free graph on n vertices has at least ${e^{(c_1-o(1)) \sqrt{n} \ln n}}$ independent sets, where $c_1 = \sqrt{\ln 2}/4 = 0.208138 \ldots$. Further, we show that for all n, there exists a triangle-free graph with n vertices which has at most ${e^{(c_2+o(1))\sqrt{n}\ln n}}$ independent sets, where $c_2 = 2\sqrt{\ln 2} = 1.665109 \ldots$. This disproves a conjecture from [8].Let H be a (k+1)-uniform linear hypergraph with n vertices and average degree t. We also show that there exists a constant ck such that the number of independent sets in H is at least ${\exp\biggl({c_{k} \frac{n}{t^{1/k}}\ln^{1+1/k}{t}\biggr})}.$ This is tight apart from the constant ck and generalizes a result of Duke, Lefmann and Rödl [9], which guarantees the existence of an independent set of size $\Omega\biggl(\frac{n}{t^{1/k}} \ln^{1/k}t\biggr).$ Both of our lower bounds follow from a more general statement, which applies to hereditary properties of hypergraphs.

scholarly journals Lower bounds for constant degree independent sets

1994 ◽  
Vol 127 (1-3) ◽  
pp. 15-21 ◽  
Author(s):  
Michael O. Albertson ◽  
Debra L. Boutin
Keyword(s):  
Lower Bounds ◽  
Independent Sets ◽  
Constant Degree
Sign in / Sign up

Export Citation Format

Share Document