The automorphism group of projective norm graphs
From MaRDI portal
Publication:6631553
DOI10.1007/s00200-022-00590-3MaRDI QIDQ6631553
Tamás Mészáros, Tibor Szabó, Lajos Rónyai, Tomáš Bayer
Publication date: 1 November 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Polynomials over finite fields (11T06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- Variety evasive sets
- On edges not in monochromatic copies of a fixed bipartite graph
- Unimodular graphs and Eisenstein sums
- A randomized embedding algorithm for trees
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- A contribution to the Zarankiewicz problem
- Product representations of polynomials
- Forbidden subgraphs in the norm graph
- Automorphisms of finite fields
- Cycle lengths in sparse graphs
- Some constructive bounds on Ramsey numbers
- Norm-graphs: Variations and applications
- Vraagstuk XXVIII.
- New bounds on crossing numbers
- Superpolynomial lower bounds for monotone span programs
- Turán numbers for Berge-hypergraphs and related extremal problems
- Bounds for bipartite rainbow Ramsey numbers
- Sharp bounds for some multicolour Ramsey numbers
- Norm-graphs and bipartite Turán numbers
- Eine Extremalaufgabe aus der Graphentheorie.
- A semi-algebraic version of Zarankiewicz's problem
- Multicolored set multipartite Ramsey numbers
- Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers
- Some new results in extremal graph theory
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs
- Infinite Turán Problems for Bipartite Graphs
- A note on projective norm graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Coloring with three‐colored subgraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
- The number of K s,t -free graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- On Graphs that do not Contain a Thomsen Graph
- MaxCut in ${\bm H)$-Free Graphs
- On the structure of linear graphs
- Counting configuration-free sets in groups
- Many \(T\) copies in \(H\)-free graphs
- Exploring projective norm graphs
This page was built for publication: The automorphism group of projective norm graphs
