1 problem

0 votes0 replies1 view
Common-neighborhood and common-antineighborhood conjecture for dense graphs
Let $G$ be a graph on $n$ vertices with edge density $\varepsilon$ , meaning that $G$ has $\varepsilon\binom{n}{2}$ edges, up to the interpretation of the source's phrase “…
Conjectureopendense-graphs extremal-graph-theory graph-neighborhoodsarXiv posted 2 days ago

Common-neighborhood and common-antineighborhood conjecture for dense graphs