Skip to main content
Connor's user avatar
Connor's user avatar
Connor's user avatar
Connor
  • Member for 10 years, 7 months
  • Last seen more than a week ago
Loading…
awarded
Loading…
comment
Any results concerning the numbers of vertices and edges to form fixed number of cliques in $K_n$?
Sorry, there was a typo. It should be $t(n)$, not $k(n)$. So the problem is given $s\ge 2$ (a fixed constant) and $t$ (which can be a function depending on $n$ and we can assume $t(n)\gg 1$), what can we say about $a$ and $b$?
Loading…
comment
Any results concerning the numbers of vertices and edges to form fixed number of cliques in $K_n$?
@RobertIsrael I mean they come from an $a$-vertex clique which satisfies $t$ is around $\binom{a}{s}$, so they “intersect” a lot.
Loading…
awarded
awarded
comment
Find large "induced" bipartite graph in a dense graph?
@LouisEsperet Yes, but how do you guarantee the requirement $e_G(A,B)=e_H(A,B)$?
comment
Find large "induced" bipartite graph in a dense graph?
@LouisEsperet But how if some edges between $A$ and $B$ are removed?
revised
Loading…
comment
Find large "induced" bipartite graph in a dense graph?
It reflects on $e_G(A,B)=e_H(A,B)$.
revised
Loading…
comment
Find large "induced" bipartite graph in a dense graph?
Yes, but also with requirement that the edges between $A$ and $B$ in $G$ are same as those of $H$.
Loading…
Loading…
Loading…
comment
Known result about existence of $n$-vertex $k$-uniform $r$-hypergraphs?
Yes, $\tilde{\theta}(n)$ means it has order of magnitude of $n$ up to some power of logarithm factor $\log n$. For example $(\log n)^8 n$. While I think it is more meaningful to require $\tilde{\theta}(\sqrt{n})$, so I revised it.