
handle: 11573/1673370
The present paper reviews some results about the Turan number of bipartite graphs and about clique-free pseudorandom graphs. The geometric aspect of known construction is highlighted, sometimes providing a different proof of known results and giving a new prospective on how to tackles such problems. Some new results are also presented.
extremal graphs; algebraic varieties over finite fields
extremal graphs; algebraic varieties over finite fields
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
