A note on projective norm graphs
From MaRDI portal
Publication:4595101
DOI10.1142/S1793042118500057zbMATH Open1379.05059arXiv1607.01141OpenAlexW2964286598MaRDI QIDQ4595101FDOQ4595101
Publication date: 28 November 2017
Published in: International Journal of Number Theory (Search for Journal in Brave)
Abstract: The projective norm graphs P(q, 4) introduced by Alon, R'onyai and Szab'o are explicit examples of extremal graphs not containing K_4,7. Ball and Pepe showed that P(q, 4) does not contain a copy of K_5,5 either for q >= 7, asymptotically improving the best lower bound for ex(n, K_5,5). We show that these results can not be improved, in the sense that P(q, 4) contains a copy of K_4,6 for infinitely many primes q.
Full work available at URL: https://arxiv.org/abs/1607.01141
Recommendations
- Note on projective graphs
- On the spectrum of projective norm-graphs
- A note on projective normality
- Projective Dimension of Some Graphs
- Norm-graphs: Variations and applications
- Graphs with projective linear stabilizers
- Two remarks on graph norms
- Projective theory of graphs and configurations of lines
- An algebraic characterization of projective‐planar graphs
- Projective graph theory and configurations of lines
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Separable extensions, Galois theory (12F10)
Cites Work
- ON THE LINEAR INDEPENDENCE OF ROOTS
- Title not available (Why is that?)
- Norm-graphs and bipartite Turán numbers
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Norm-graphs: Variations and applications
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Title not available (Why is that?)
- Mapping incidences
- The early evolution of the \(H\)-free process
- Title not available (Why is that?)
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Chebotarëv and his density theorem
- Lower bounds for the size of random maximal \(H\)-free graphs
- Random algebraic construction of extremal graphs
- Fp is locally like ℂ
Cited In (4)
This page was built for publication: A note on projective norm graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595101)