Norm-graphs and bipartite Turán numbers
From MaRDI portal
Publication:2563514
DOI10.1007/BF01261323zbMath0858.05061OpenAlexW2148275926MaRDI QIDQ2563514
János Kollár, Tibor Szabó, Lajos Rónyai
Publication date: 11 March 1997
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01261323
Related Items
On counting point-hyperplane incidences, Disjointly representing set systems, Separating OR, SUM, and XOR circuits, Structured Codes of Graphs, On Turán exponents of bipartite graphs, Multicolour Turán problems, The number of \(C_{2\ell}\)-free graphs, A semi-algebraic version of Zarankiewicz's problem, Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\), Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\), Random algebraic construction of extremal graphs, On the Extremal Number of Subdivisions, Some extremal results on hypergraph Turán problems, The number of copies of \(K_{2,t+1}\) in a graph, Some remarks on the Zarankiewicz problem, Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions, Forbidding multiple copies of forestable graphs, An average degree condition for independent transversals, Some extremal results on complete degenerate hypergraphs, The number of 4-cycles in a graph, The Turán number of blow-ups of trees, Turán numbers of bipartite graphs plus an odd cycle, Bipartite Turán problems for ordered graphs, Balanced supersaturation for some degenerate hypergraphs, Bipartite-ness under smooth conditions, A note on projective norm graphs, Graphs with few paths of prescribed length between any two vertices, Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Random multilinear maps and the Erd\H{o}s box problem, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, Turán numbers of several bipartite graphs, Forbidden subgraphs in the norm graph, Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles, On discrepancy bounds via dual shatter function, Variety evasive sets, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Bounds for generalized Sidon sets, More on the extremal number of subdivisions, Bipartite algebraic graphs without quadrilaterals, On edges not in monochromatic copies of a fixed bipartite graph, Cycle lengths in sparse graphs, Relative Turán Problems for Uniform Hypergraphs, Bipartite Ramsey numbers of \(K_{t,s}\) in many colors, Unimodular graphs and Eisenstein sums, Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices, On the rational Turán exponents conjecture, Turán numbers for Berge-hypergraphs and related extremal problems, New lower bounds for Ramsey numbers of graphs and hypergraphs, Constructive lower bounds for off-diagonal Ramsey numbers, Unnamed Item, A randomized embedding algorithm for trees, A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems, Regular Turán numbers of complete bipartite graphs, On the spectrum of projective norm-graphs, Turán Numbers of Bipartite Subdivisions, Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle, Short proofs of some extremal results III, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Tropical Complexity, Sidon Sets, and Dynamic Programming, A hypergraph extension of the bipartite Turán problem, Generalized Turán problems for complete bipartite graphs, Norm-graphs: Variations and applications, Tight bounds for powers of Hamilton cycles in tournaments, Inverse Turán numbers, Meyniel extremal families of abelian Cayley graphs
Cites Work
