Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Raz, Abigail"'
Autor:
Lu, Kengbo, Raz, Abigail
The Union-Closed Sets Conjecture, often attributed to P\'eter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets $S\neq\{\emptyset\}$, if the union of any two sets in the family is also in th
Externí odkaz:
http://arxiv.org/abs/2405.10639
Autor:
Meger, Erin, Raz, Abigail
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform random graph models. In this paper we introduce a new, Iterative Indep
Externí odkaz:
http://arxiv.org/abs/2209.01093
The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token on the vertices of a graph. At each time step, the Explorer specifies
Externí odkaz:
http://arxiv.org/abs/2104.09451
Autor:
Meger, Erin, Raz, Abigail
Publikováno v:
In Discrete Applied Mathematics 31 December 2023 341:242-256
Autor:
Raz, Abigail
This paper examines the structure of the largest subgraphs of the Erd\H{o}s-R\'enyi random graph, $G_{n,p}$, with a given matching number. This extends a result of Erd\H{o}s and Gallai who, in 1959, gave a classification of the structures of the larg
Externí odkaz:
http://arxiv.org/abs/1904.11571
Autor:
Raz, Abigail
This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $\xi_H= \xi_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand the upper
Externí odkaz:
http://arxiv.org/abs/1903.07488
Autor:
Raz, Abigail
The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average set size
Externí odkaz:
http://arxiv.org/abs/1704.07022
Publikováno v:
Electronic Journal of Combinatorics, 20 (2013), no. 2, article P43
A signed graph is a graph whose edges are given (-1,+1) weights. In such a graph, the sign of a cycle is the product of the signs of its edges. A signed graph is called balanced if its adjacency matrix is similar to the adjacency matrix of an unsigne
Externí odkaz:
http://arxiv.org/abs/1301.0973
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.