中文
相关论文

相关论文: The profile polytope of non-trivial intersecting f…

200 篇论文

Let $n$, $r$, $k_1,\ldots,k_r$ and $t$ be positive integers with $r\geq 2$, and $\mathcal{F}_i\ (1\leq i\leq r)$ a family of $k_i$-subsets of an $n$-set $V$. The families $\mathcal{F}_1,\ \mathcal{F}_2,\ldots,\mathcal{F}_r$ are said to be…

组合数学 · 数学 2022-05-24 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

组合数学 · 数学 2019-07-02 Ferdinand Ihringer , Andrey Kupavskii

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A…

组合数学 · 数学 2021-03-23 Mengyu Cao , Benjian Lv , Kaishun Wang

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. In this paper we describe the structure of maximal non-trivial $t$-intersecting families of $k$-dimensional subspaces of $V$ with large size. We also determine…

组合数学 · 数学 2020-07-24 Mengyu Cao , Benjian Lv , Kaishun Wang , Sanming Zhou

Let $\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\mathcal F \subset \mathcal T_n$ is $t$-intersecting if for all $A, B \in \mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we…

组合数学 · 数学 2025-07-25 Elizaveta Iarovikova , Andrey Kupavskii

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

组合数学 · 数学 2023-04-28 Norihide Tokushige

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all…

组合数学 · 数学 2022-09-07 Peter Frankl

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

组合数学 · 数学 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if…

组合数学 · 数学 2019-11-05 Jason O'Neill , Jacques Verstraete

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq…

组合数学 · 数学 2024-11-28 Zhen Jia , Qing Xiang , Jimeng Xiao , Huajun Zhang

We present a new algorithmic approach that can be used to determine whether a given quadruple $(f_0,f_1,f_2,f_3)$ is the f-vector of any convex 4-dimensional polytope. By implementing this approach, we classify the f-vectors of 4-polytopes…

度量几何 · 数学 2016-10-05 Philip Brinkmann , Günter M. Ziegler

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

组合数学 · 数学 2022-11-23 Jagannath Bhanja , Sayan Goswami

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

组合数学 · 数学 2021-02-19 Peter Frankl , Andreas Holmsen , Andrey Kupavskii

Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called non-trivial $3$-wise intersecting if the intersection of any three subsets in $\mathcal G$ is non-empty, but the intersection of all subsets is…

组合数学 · 数学 2023-05-02 Norihide Tokushige

Denote the collection of all $k$-flats in $AG(n,\mathbb{F}_q)$ by $\mathscr{M}(k,n)$. Let $\mathscr{F}_1\subset\mathscr{M}(k_1,n)$ and $\mathscr{F}_2\subset\mathscr{M}(k_2,n)$ satisfy $\dim(F_1\cap F_2)\ge t$ for any $F_1\in\mathscr{F}_1$…

组合数学 · 数学 2022-02-16 Tian Yao , Kaishun Wang

For a positive integer $d\geq 2$, a family $\mathcal F\subseteq \binom{[n]}{k}$ is said to be d-wise intersecting if $|F_1\cap F_2\cap \dots\cap F_d|\geq 1$ for all $F_1, F_2, \dots ,F_d\in \mathcal F$. A d-wise intersecting family…

组合数学 · 数学 2023-06-08 Menglong Zhang , Tao Feng

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

度量几何 · 数学 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we characterize non-trivial intersecting family with maximum size.

组合数学 · 数学 2020-04-27 Chao Gong , Benjian Lv , Kaishun Wang

Let $V$ be a finite dimensional vector space over a finite field, and $\mathcal{F}$ a family consisting of $k$-subspaces of $V$. The family $\mathcal{F}$ is called $t$-intersecting if $\dim(F_{1}\cap F_{2})\geq t$ for any $F_{1}, F_{2}\in…

组合数学 · 数学 2024-12-18 Lijun Ji , Dehai Liu , Kaishun Wang , Tian Yao , Shuhui Yu

Let $\mathscr{P}$ be a symplectic polar space over a finite field $\mathbb{F}_q$, and $\mathscr{P}_m$ denote the set of all $m$-dimensional subspaces in $\mathscr{P}$. We say a $t$-intersecting subfamily of $\mathscr{P}_m$ is trivial if…

组合数学 · 数学 2020-10-13 Tian Yao , Benjian Lv , Kaishun Wang
‹ 上一页 1 2 3 10 下一页 ›