Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Weber, Lea"'
Autor:
Axenovich, Maria, Weber, Lea
Informally, the Erd\H{o}s-Hajnal conjecture (shortly EH-conjecture) asserts that if a sufficiently large host clique on $n$ vertices is edge-coloured avoiding a copy of some fixed edge-coloured clique, then there is a large homogeneous set of size $n
Externí odkaz:
http://arxiv.org/abs/2311.03249
The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider a variant
Externí odkaz:
http://arxiv.org/abs/2305.01531
The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider a variant
Externí odkaz:
http://arxiv.org/abs/2303.09578
Erd\H{o}s, F\"uredi, Rothschild and S\'os initiated a study of classes of graphs that forbid every induced subgraph on a given number $m$ of vertices and number $f$ of edges. Extending their notation to $r$-graphs, we write $(n,e) \to_r (m,f)$ if eve
Externí odkaz:
http://arxiv.org/abs/2208.06626
Autor:
Weber, Lea
For fixed integer $r\ge 2$, we call a pair $(m,f)$ of integers, $m\geq 1$, $0\leq f \leq \binom{m}{r}$, $absolutely$ $avoidable$ if there is $n_0$, such that for any pair of integers $(n,e)$ with $n>n_0$ and $0\leq e\leq \binom{n}{r}$ there is an $r$
Externí odkaz:
http://arxiv.org/abs/2205.15197
Autor:
Axenovich, Maria, Weber, Lea
We call a pair $(m,f)$ of integers, $m\geq 1$, $0\leq f \leq \binom{m}{2}$, \emph{absolutely avoidable} if there is $n_0$ such that for any pair of integers $(n,e)$ with $n>n_0$ and $0\leq e\leq \binom{n}{2}$ there is a graph on $n$ vertices and $e$
Externí odkaz:
http://arxiv.org/abs/2106.14908
Autor:
Sauter, Matthias1 (AUTHOR), Weber, Lea2 (AUTHOR), Jung, Dominik2 (AUTHOR), Weremko, Michael3 (AUTHOR), Bachmann, Dorothea2 (AUTHOR), Fischereder, Michael4 (AUTHOR), Bachmann, Hagen Sjard2,3 (AUTHOR) hagen.bachmann@uni-wh.de
Publikováno v:
Orphanet Journal of Rare Diseases. 3/8/2024, Vol. 19 Issue 1, p1-8. 8p.
Kostochka and Thomason independently showed that any graph with average degree $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor. In particular, any graph with chromatic number $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor, a partial result towards H
Externí odkaz:
http://arxiv.org/abs/2010.05643
Erd\H{o}s and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at least 1/2log(n) vertices. The famous Erd\H{o}s-Hajnal conjecture ass
Externí odkaz:
http://arxiv.org/abs/2005.09269
We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite complement of $G$. Let $f(n, \Delta)$ be the largest $k$ for which ev
Externí odkaz:
http://arxiv.org/abs/2002.10930