Search arXivSearch

arXiv · 1903.08984

On transversal and 2-packing numbers in uniform linear systems

Abstract

A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a family of subsets on a ground finite set $P$, such that $|l\cap l^\prime|\leq 1$, for every $l,l^\prime \in \mathcal{L}$. The elements of $P$ and $\mathcal{L}$ are called points and lines, respectively, and the linear system is called intersecting if any pair of lines intersect in exactly one point. A subset $T$ of points of $P$ is a transversal of $(P,\mathcal{L})$ if $T$ intersects any line, and the transversal number, $τ(P,\mathcal{L})$, is the minimum order of a transversal. On the other hand, a 2-packing set of a linear system $(P,\mathcal{L})$ is a set $R$ of lines, such that any three of them have a common point, then the 2-packing number of $(P,\mathcal{L})$, $ν_2(P,\mathcal{L})$, is the size of a maximum 2-packing set. It is known that the transversal number $τ(P,\mathcal{L})$ is bounded above by a quadratic function of $ν_2(P,\mathcal{L})$. An open problem is to haracterize the families of linear systems which satisfies $τ(P,\mathcal{L})\leq λν_2(P,\mathcal{L})$, for some $λ\geq1$. In this paper, we give an infinite family of linear systems $(P,\mathcal{L})$ which satisfies $τ(P,\mathcal{L})=ν_2(P,\mathcal{L})$ with smallest possible cardinality of $\mathcal{L}$, as well as some properties of $r$-uniform intersecting linear systems $(P,\mathcal{L})$, such that $τ(P,\mathcal{L})=ν_2(P,\mathcal{L})=r$. Moreover, we state a characterization of $4$-uniform intersecting linear systems $(P,\mathcal{L})$ with $τ(P,\mathcal{L})=ν_2(P,\mathcal{L})=4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos A. Alfaro, G. Araujo-Pardo, C. Rubio-Montiel, Adrián Vázquez-Ávila. 2019-03-28. On transversal and 2-packing numbers in uniform linear systems. https://arxiv.org/abs/1903.08984

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

KEEP EXPLORING

Related papers

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

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