Zobrazeno 1 - 10
of 25
pro vyhledávání: '"De Silva, Jessica"'
Publikováno v:
Involve 16 (2023) 35-47
A family of independent $r$-sets of a graph $G$ is an $r$-star if every set in the family contains some fixed vertex $v$. A graph is $r$-EKR if the maximum size of an intersecting family of independent $r$-sets is the size of an $r$-star. Holroyd and
Externí odkaz:
http://arxiv.org/abs/2106.09067
Landau, Reid, and Yershov [A Fair Division Solution to the Problem of Redistricting, \textit{Social Choice and Welfare}, 2008] propose a protocol for drawing legislative districts based on a two player fair division process, where each player is enti
Externí odkaz:
http://arxiv.org/abs/1811.05705
The Ramsey multiplicity constant of a graph $H$ is the minimum proportion of copies of $H$ in the complete graph which are monochromatic under an edge-coloring of $K_n$ as $n$ goes to infinity. Graphs for which this minimum is asymptotically achieved
Externí odkaz:
http://arxiv.org/abs/1801.00474
For two graphs $G$ and $H$, the Tur\'{a}n number $ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Tur\'{a}n numbers $ex(K_{m,n},kK_2)$ for all $k\geq 1$ [7]. In this paper we
Externí odkaz:
http://arxiv.org/abs/1610.00777
Autor:
Aalipour, Ghodratollah, Abiad, Aida, Berikkyzy, Zhanar, Cummings, Jay, De Silva, Jessica, Gao, Wei, Heysse, Kristin, Hogben, Leslie, Kenter, Franklin H. J., Lin, Jephian C. -H., Tait, Michael
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the distance spec
Externí odkaz:
http://arxiv.org/abs/1509.01196
An edge-ordering of a graph $G=(V,E)$ is a bijection $\phi:E\to\{1,2,...,|E|\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\phi(e_i)<\phi(e_j)$ for all $i
Externí odkaz:
http://arxiv.org/abs/1502.03146
Publikováno v:
Electronic Journal of Combinatorics 20, no. 3 (2013), P22
An \emph{interval vector} is a $(0,1)$-vector in $\mathbb{R}^n$ for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of interval vectors in $\mathbb{R}^n$. We study three particular classes of
Externí odkaz:
http://arxiv.org/abs/1211.2039
Autor:
Aalipour, Ghodratollah, Abiad, Aida, Berikkyzy, Zhanar, Cummings, Jay, De Silva, Jessica, Gao, Wei, Heysse, Kristin, Hogben, Leslie, Kenter, Franklin H.J., Lin, Jephian C.-H., Tait, Michael
Publikováno v:
In Linear Algebra and Its Applications 15 May 2016 497:66-87
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.