Norm-graphs: Variations and applications
From MaRDI portal
Recommendations
Cites work
- An Upper Bound on Zarankiewicz' Problem
- Bombieri's theorem in short intervals
- Discrepancy and approximations for bounded VC-dimension
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3749050 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 1131467 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- New asymptotics for bipartite Turán numbers
- Norm-graphs and bipartite Turán numbers
- On a problem of K. Zarankiewicz
- On discrepancy bounds via dual shatter function
- On Graphs that do not Contain a Thomsen Graph
- On multicolor Ramsey numbers for complete bipartite graphs
Cited in
(only showing first 100 items - show all)- On the spectrum of projective norm-graphs
- Some extremal results on complete degenerate hypergraphs
- Bipartite algebraic graphs without quadrilaterals
- A hypergraph extension of the bipartite Turán problem
- On generalized Ramsey theory: The bipartite case
- On counting point-hyperplane incidences
- Multicolour Turán problems
- On the rational Turán exponents conjecture
- Turán numbers for Berge-hypergraphs and related extremal problems
- Generalized Turán problems for complete bipartite graphs
- Tight bounds for powers of Hamilton cycles in tournaments
- Multicolor Ramsey numbers for Berge cycles
- Inverse Turán numbers
- Two remarks on graph norms
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Some extremal results on hypergraph Turán problems
- The number of copies of \(K_{2,t+1}\) in a graph
- Forbidding multiple copies of forestable graphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- A linear hypergraph extension of the bipartite Turán problem
- More on the extremal number of subdivisions
- Bipartite Ramsey numbers of \(K_{t,s}\) in many colors
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Bounds for bipartite rainbow Ramsey numbers
- Degree Ramsey numbers for even cycles
- A semi-algebraic version of Zarankiewicz's problem
- Multicolored set multipartite Ramsey numbers
- Maximum norms of graphs and matrices, and their complements
- An average degree condition for independent transversals
- The number of 4-cycles in a graph
- The Turán number of blow-ups of trees
- Bipartite Turán problems for ordered graphs
- Cayley sum graphs and their applications to codebooks
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- The number of \(C_{2\ell}\)-free graphs
- Dependent random choice
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- The solvability of norm, bilinear and quadratic equations over finite fields via spectra of graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Random algebraic construction of extremal graphs
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- A note on eigenvalue bounds for independence numbers of non-regular graphs
- Turán numbers of bipartite graphs plus an odd cycle
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- A note on projective norm graphs
- Sign rank versus Vapnik-Chervonenkis dimension
- The Zero Forcing Number of Graphs
- Bipartite subgraphs of H-free graphs
- Bipartite independence number in graphs with bounded maximum degree
- Random multilinear maps and the Erdős box problem
- On edges not in monochromatic copies of a fixed bipartite graph
- On the extremal number of subdivisions
- Some remarks on the Zarankiewicz problem
- Graphs with few paths of prescribed length between any two vertices
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Relative Turán problems for uniform hypergraphs
- Unimodular graphs and Eisenstein sums
- Turán number of an induced complete bipartite graph plus an odd cycle
- Turán Problems and Shadows III: Expansions of Graphs
- Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
- Pseudorandom Graphs from Elliptic Curves
- A randomized embedding algorithm for trees
- Upper and lower bounds on the size of \(B_k[g]\) sets
- Structured Codes of Graphs
- An exact characterization of saturation for permutation matrices
- On Turán exponents of bipartite graphs
- Many \(T\) copies in \(H\)-free graphs
- Counting configuration-free sets in groups
- Constructive lower bounds for off-diagonal Ramsey numbers
- Many \(T\) copies in \(H\)-free graphs
- Balanced supersaturation for some degenerate hypergraphs
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
- Bipartite-ness under smooth conditions
- Turán numbers of several bipartite graphs
- Spectral Turán problems for intersecting even cycles
- Exact values for some unbalanced Zarankiewicz numbers
- Multi-color Ramsey numbers of two bipartite graphs
- Zarankiewicz numbers near the triple system threshold
- Extremal graphs without exponentially small bicliques
- Discrepancy and sparsity
- Exploring projective norm graphs
- Implicit representation of sparse hereditary families
- The automorphism group of projective norm graphs
- A polynomial resultant approach to algebraic constructions of extremal graphs
- Monochromatic graph decompositions inspired by anti-Ramsey colorings
- The sparse regularity method with Schatten norms and entropy
- On the boundedness of degenerate hypergraphs
- Improved upper bounds on Zarankiewicz numbers
- Turán problems in pseudorandom graphs
- The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
- Extremal number of graphs from geometric shapes
- Forbidden subgraphs and complete partitions
- The de Bruijn-Erdős theorem for hypergraphs
- Phase transition of degenerate Turán problems in p-norms
- Unavoidable patterns in 2-colorings of the complete bipartite graph
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Turán number of complete bipartite graphs with bounded matching number
- On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
This page was built for publication: Norm-graphs: Variations and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306316)
