相关论文: A 920-block explicit construction guaranteeing a t…
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…
Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type B. We find a formula for the number of minimally intersecting r-tuples of $B_n$-partitions, as well as a…
Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…
In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…
Motivated by a question of Erd\H{o}s on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $\mathbb{P}^2(\mathbb{F}_q)$. In this…
A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making…
We give a tight bound for the triple intersection numbers of Paley graphs. In particular, we show that any three vertices have a common neighbor in Paley graphs of order larger than 25.
An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's…
Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…
A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies.…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
A family $\mathcal{F}\subset \binom{[n]}{k}$ is called an intersecting family if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. If $\cap \mathcal{F}\neq \emptyset$ then $\mathcal{F}$ is called a star. The diversity of an…
We show explicitly that supersymmetric $E_6$ Grand Unified Theory with a Higgs sector consisting of $\{27+\bar{27}+351'+\bar{351'}+78\}$ fields provides a realistic scenario for symmetry breaking and fermion mass generation. While gauge…
Consider the domain $E$ in $\mathbb{C}^3$ defined by $$ E=\{(a_{11},a_{22},\text{det}A): A=\begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}\text{ with }\lVert A \rVert <1\}. $$ This is called the tetrablock. This paper…