相关论文: General position sets, colinear sets, and Sierpi\'…

A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the…

The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpi\'{n}ski triangle graphs. Sierpi\'{n}ski triangle graphs, also known as…

We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…

A vertex set $S$ is a generalized $k$-independent set if the induced subgraph $G[S]$ contains no tree on $k$ vertices. The generalized $k$-independence number $\alpha_k(G)$ is the maximum size of such a set. For a tree $T$ with $n$…

In this paper we shall introduce some nonmeasurable and completely nonmeasurable subsets of the plane with various additional properties, e.g. being Hamel basis, intersecting each line in a strong Luzin / Sierpi\'nski set. Also some…

In a given graph $G$, a set $S$ of vertices with an assignment of colors is a {\sf defining set of the vertex coloring of $G$}, if there exists a unique extension of the colors of $S$ to a $\Cchi(G)$-coloring of the vertices of $G$. A…

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…

In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…

If $G$ is a graph and $X\subseteq V(G)$, then $X$ is a total mutual-visibility set if every pair of vertices $x$ and $y$ of $G$ admits a shortest $x,y$-path $P$ with $V(P) \cap X \subseteq \{x,y\}$. The cardinality of a largest total…

A self-map $T$ of a $\nu$-generalized metric space $(X,d\,)$ is said to be a Ciric-Matkowski contraction if $d(Tx,Ty)<d(x,y)$, for $x\neq y$, and, for every $\epsilon>0$, there is $\delta>0$ such that $d(x,y)<\delta+\epsilon$ implies…

Let $R$ be a group and let $S$ be a subset of $R$. The Haar graph $\mathrm{Haar}(R,S)$ of $R$ with connection set $S$ is the graph having vertex set $R\times\{-1,1\}$, where two distinct vertices $(x,-1)$ and $(y,1)$ are declared to be…

We study the removability of compact sets for continuous Sobolev functions. In particular, we focus on sets with infinitely many complementary components, called "detour sets", which resemble the Sierpi\'nski gasket. The main theorem is…

A set $B\subseteq V(G)$ is called a $k$-total limited packing set in a graph $G$ if $|B\cap N(v)|\leq k$ for any vertex $v\in V(G)$. The $k$-total limited packing number $L_{k,t}(G)$ is the maximum cardinality of a $k$-total limited packing…

Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…

A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…

We deal with different kinds of generalizations of $\mathcal{S}^*(\psi)$, the class of Ma-Minda starlike functions, in addition to a majorization result of $\mathcal{C}(\psi),$ the class of Ma-Minda convex functions, which are enlisted as…

This paper considers the \textit{Zarankiewicz problem} in graphs with low-dimensional geometric representation (i.e., low Ferrers dimension). Our first result reveals a separation between bipartite graphs of Ferrers dimension three and…

We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…