Search arXivSearch

arXiv · 1509.03696

On transversal and $2$-packing numbers in straight line systems on $\mathbb{R}^{2}$

Abstract

A linear system is a pair $(X,\mathcal{F})$ where $\mathcal{F}$ is a finite family of subsets on a ground set $X$, and it satisfies that $|A\cap B|\leq 1$ for every pair of distinct subsets $A,B \in \mathcal{F}$. As an example of a linear system are the straight line systems, which family of subsets are straight line segments on $\mathbb{R}^{2}$. By $τ$ and $ν_2$ we denote the size of the minimal transversal and the 2--packing numbers of a linear system respectively. A natural problem is asking about the relationship of these two parameters; it is not difficult to prove that there exists a quadratic function $f$ holding $τ\leq f(ν_2)$. However, for straight line system we believe that $τ\leqν_2-1$. In this paper we prove that for any linear system with $2$-packing numbers $ν_2$ equal to $2, 3$ and $4$, we have that $τ\leqν_2$. Furthermore, we prove that the linear systems that attains the equality have transversal and $2$-packing numbers equal to $4$, and they are a special family of linear subsystems of the projective plane of order $3$. Using this result we confirm that all straight line systems with $ν_2\in\{2,3,4\}$ satisfies $τ\leqν_2-1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gabriela Araujo-Pardo, Amanda Montejano, Luis Montejano, Adrián Vázquez-Ávila. 2015-09-12. On transversal and $2$-packing numbers in straight line systems on $\mathbb{R}^{2}$. https://arxiv.org/abs/1509.03696

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