On the structure of linear graphs
From MaRDI portal
Publication:5842850
DOI10.1090/S0002-9904-1946-08715-7zbMath0063.01277OpenAlexW2111007781WikidataQ29395510 ScholiaQ29395510MaRDI QIDQ5842850
Publication date: 1946
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1946-08715-7
Related Items
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, A problem of Erdős and Sós on 3-graphs, Correlation among runners and some results on the lonely runner conjecture, On the complexity of finite subgraphs of the curve graph, The number of \(C_{2\ell}\)-free graphs, Extremal problems concerning transformations of the set of edges of the complete graph, Ramsey numbers of a fixed odd-cycle and generalized books and fans, An extension of the Erdős-Stone theorem, Graphs without theta subgraphs, On the jumping constant conjecture for multigraphs, A note on non-jumping numbers for \(r\)-uniform hypergraphs, Symmetry in Turán sums of squares polynomials from flag algebras, On substructure densities of hypergraphs, Embedding tetrahedra into quasirandom hypergraphs, Unique low rank completability of partially filled matrices, Extremal results for random discrete structures, A note on the jumping constant conjecture of Erdős, Hypergraphs do not jump, More results on Ramsey-Turán type problems, On the Turán number of some ordered even cycles, Blow-up lemma, Tournaments as strong subcontractions, Stability results for graphs with a critical edge, On the density of a graph and its blowup, Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions, Non-jumping numbers for 4-uniform hypergraphs, Pan-\(H\)-linked graphs, Using Lagrangians of hypergraphs to find non-jumping numbers. II., Turán's theorem for pseudo-random graphs, Color the cycles, Some extremal results on complete degenerate hypergraphs, An exact Turán result for tripartite 3-graphs, The maximal length of a gap between \(r\)-graph Turán densities, On the Turán number of forests, Maximum planar subgraphs in dense graphs, The extremal graph problem of the icosahedron, Turán numbers of bipartite graphs plus an odd cycle, Some extremal problems for hereditary properties of graphs, On the local approach to Sidorenko's conjecture, A skew version of the Loebl-Komlós-Sós conjecture, The minimum number of triangles in graphs of given order and size, The critical number of dense triangle-free binary matroids, The extremal function for partial bipartite tilings, On low tree-depth decompositions, Minimum \(H\)-decompositions of graphs: edge-critical case, Forbidden subgraphs in the norm graph, Evidence for a forbidden configuration conjecture: One more case solved, Extremal graphs for intersecting cliques, Degree powers in graphs with a forbidden forest, 3-uniform hypergraphs avoiding a given odd cycle, On the number of edges not covered by monochromatic copies of a fixed graph., Edges not in any monochromatic copy of a fixed graph, On possible Turán densities, The number of \(K_{m,m}\)-free graphs, On the KŁR conjecture in random graphs, On the chromatic number of \(H\)-free graphs of large minimum degree, On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite, The maximum edit distance from hereditary graph properties, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, On a Turán type problem of Erdős, Extremal results for odd cycles in sparse pseudorandom graphs, A note on the structure of Turán densities of hypergraphs, Forbidden configurations and product constructions, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, On embedding well-separable graphs, Quadripartite version of the Hajnal-Szemerédi theorem, Constructions of non-principal families in extremal hypergraph theory, Edge-colorings avoiding rainbow and monochromatic subgraphs, Generating non-jumping numbers recursively, Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, Davenport-Schinzel theory of matrices, A neighborhood condition which implies the existence of a complete multipartite subgraph, An analogue of the Erdős-Stone theorem for finite geometries, Excluding induced subgraphs. II: Extremal graphs, Forbidden Berge hypergraphs, A tournament approach to pattern avoiding matrices, Proof of the bandwidth conjecture of Bollobás and Komlós, Packing of graphs with small product of sizes, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, Vertex Turán problems in the hypercube, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, On jumping densities of hypergraphs, On finite simple groups and Kneser graphs., The early evolution of the \(H\)-free process, Extremal \(G\)-free induced subgraphs of Kneser graphs, Graphic sequences with a realization containing a complete multipartite subgraph, Packings of graphs and applications to computational complexity, Hereditary properties of hypergraphs, Unit distances and diameters in Euclidean spaces, Variations on the theme of repeated distances, Bandwidth theorem for random graphs, On an extremal problem in graph theory., On non-strong jumping numbers and density structures of hypergraphs, Complete \(r\)-partite subgraphs of dense \(r\)-graphs, Supersaturated graphs and hypergraphs, Induced subgraphs of given sizes, The maximum number of edges in a graph of bounded dimension, with applications to ring theory, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, On the algebraic and topological structure of the set of Turán densities, Separating pairs of points of standard boxes, Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size, Structured Codes of Graphs, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Many Turán exponents via subdivisions, Universal and unavoidable graphs, On Turán exponents of bipartite graphs, Subgraph densities in a surface, Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers, Tree densities in sparse graph classes, Minimum Degrees for Powers of Paths and Cycles, Extremal problems on set systems, Dirac-type results for tilings and coverings in ordered graphs, Random algebraic construction of extremal graphs, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets, A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs, An Irrational Lagrangian Density of a Single Hypergraph, On the Extremal Number of Subdivisions, A Brooks‐Type Theorem for the Bichromatic Number, Counting independent sets in triangle-free graphs, Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$, Forbidding \(K_{2,t}\) traces in triple systems, Extremal graphs for edge blow-up of graphs, On Generalized Turán Results in Height Two Posets, Extremal problems for multigraphs, On the abstract chromatic number and its computability for finitely axiomatizable theories, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs, Graphs with large maximum degree containing no edge-critical graphs, Hypergraph Turán densities can have arbitrarily large algebraic degree, Nearly \(k\)-distance sets, Bipartite Turán problems for ordered graphs, Embedding spanning subgraphs of small bandwidth, On a conjecture of spectral extremal problems, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Graphs with few paths of prescribed length between any two vertices, Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}, Turán problems for edge-ordered graphs, On the Chromatic Thresholds of Hypergraphs, Tree decompositions of graphs without large bipartite holes, Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles, The Zero Forcing Number of Graphs, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, New lower bounds for the Turán density of \(PG_m(q)\), The Turán number for the edge blow-up of trees: the missing case, On maximal paths and circuits of graphs, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, An Upper Bound on Zarankiewicz' Problem, GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A Local Approach to the Erdös--Sós Conjecture, Edge-decompositions of graphs with high minimum degree, Extremal Graphs with Local Covering Conditions, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, On Families of Subsets With a Forbidden Subposet, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, Turánnical hypergraphs, A Spectral Erdős–Stone–Bollobás Theorem, Induced Turán Numbers, Paul Erdős, 1913-1996, Stability results for random discrete structures, Monochromatic Kr‐Decompositions of Graphs, Unnamed Item, Unnamed Item, Unnamed Item, DOUBLE‐NORMAL PAIRS IN SPACE, Ramsey numbers for tournaments, Stability of the Potential Function, Minimum rainbow \(H\)-decompositions of graphs, A median-type condition for graph tiling, Minimum rainbow \(H\)-decompositions of graphs, On the densities of cliques and independent sets in graphs, Two approaches to Sidorenko’s conjecture, Many \(T\) copies in \(H\)-free graphs, The Extremal Number of the Subdivisions of the Complete Bipartite Graph, Hypergraphs Do Jump, Regular Tur\'an numbers, Turán Numbers of Bipartite Subdivisions, An Extremal Graph Problem with a Transcendental Solution, Minimizing the number of 5-cycles in graphs with given edge-density, Hypergraphs with Few Berge Paths of Fixed Length between Vertices, ExtremalC4-Free/C5-Free Planar Graphs, On the structure of Dense graphs with bounded clique number, Supersaturation of even linear cycles in linear hypergraphs, Turán numbers of theta graphs, Ramsey properties of randomly perturbed graphs: cliques and cycles, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, On the 3‐Local Profiles of Graphs, Independent sets in hypergraphs, On the Codegree Density of $PG_m(q)$, Minimum degree conditions for large subgraphs, Hypergraphs with no odd cycle of given length, Ramsey Numbers Involving Large Books, Maker-Breaker Games on Randomly Perturbed Graphs, Incidence Relations in Unicoherent Spaces, On the Turán Number of the Blow-Up of the Hexagon, An Erdős-Stone Type Conjecture for Graphic Sequences, Complete Partite subgraphs in dense hypergraphs, Partite Saturation Problems, A Density Turán Theorem, The maximum number of triangles in \(F_k\)-free graphs, Turán and Ramsey numbers for 3‐uniform minimal paths of length 4, Extremal graphs for odd wheels, Andrásfai and Vega graphs in Ramsey–Turán theory, On the maximum number of odd cycles in graphs without smaller odd cycles, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, A Spectral Erdős-Sós Theorem, Balanced supersaturation for some degenerate hypergraphs, Edges Not Covered by Monochromatic Bipartite Graph, LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS, Bipartite-ness under smooth conditions, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, Turán number for odd‐ballooning of trees, Minimum degree and the graph removal lemma, On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles, Ramsey non-goodness involving books, Uniform Turán density of cycles, Some exact results for non-degenerate generalized Turán problems, Planar Turán numbers of cubic graphs and disjoint union of cycles, A 2-stable family of triple systems, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, F$F$‐factors in Quasi‐random Hypergraphs, Random polynomial graphs for random Turán problems, Rainbow clique subdivisions, Embedding bipartite distance graphs under Hamming metric in finite fields, The Ramsey number of a long even cycle versus a star, Every graph is eventually Turán-good, On the Turán density of uniform hypergraphs, Turán‐type problems for long cycles in random and pseudo‐random graphs, The Turán number of the grid, The bipartite Turán number and spectral extremum for linear forests, Turán numbers of several bipartite graphs, Spectral Turán problems for intersecting even cycles, Graphs without a Rainbow Path of Length 3, On the Turán number of the hypercube, Restricted problems in extremal combinatorics, An \(A_{\alpha}\)-spectral Erdős-Sós theorem, Unnamed Item, On 1-subdivisions of transitive tournaments, Ramsey numbers of fans and large books, Turán numbers for hypergraph star forests, Forbidden families of minimal quadratic and cubic configurations, Spectral extremal graphs for intersecting cliques, Turán-Ramsey theorems and simple asymptotically extremal structures, Tilings in vertex ordered graphs, Dirac-type theorems in random hypergraphs, On the structure of linear graphs, Some exact results for generalized Turán problems, Size and structure of large \((s,t)\)-union intersecting families, Accumulation points of the edit distance function, The spectral radius of graphs with no intersecting odd cycles, The Turán number of the triangular pyramid of 3-layers, Generalized rainbow Turán problems, Multicolor Turán numbers, Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\), Generalized Turán number for linear forests, On the Ramsey-Turán density of triangles, Co-degree density of hypergraphs, Some extremal results on hypergraph Turán problems, On extremal problems of graphs and generalized graphs, Turán's extremal problem in random graphs: Forbidding odd cycles, A note on sparse supersaturation and extremal results for linear homogeneous systems, Counting \(r\)-graphs without forbidden configurations, Forbidding multiple copies of forestable graphs, Turán-Ramsey problems, The Ramsey-Turán problem for cliques, Extremal \(H\)-free planar graphs, A version of the Loebl-Komlós-Sós conjecture for skew trees, Extremal problems in uniformly dense hypergraphs, Inverting the Turán problem, Non-jumping numbers for 5-uniform hypergraphs, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, Estimating and understanding exponential random graph models, Critical graphs without triangles: an optimum density construction, On a conjecture of Erdős and Simonovits: even cycles, On the Ramsey-Turán numbers of graphs and hypergraphs, Extremal results in sparse pseudorandom graphs, Maximising the number of cycles in graphs with forbidden subgraphs, Graphs with no induced \(K_{2,t}\), \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, On induced saturation for paths, Bounding the number of cycles in a graph in terms of its degree sequence, \((k,l)\)-colourings and Ferrers diagram representations of cographs, Large cliques in hypergraphs with forbidden substructures, On the Turán density of \(\{1, 3\}\)-hypergraphs, The Turán number for the edge blow-up of trees, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), On the cover Turán number of Berge hypergraphs, More on the extremal number of subdivisions, Two results on Ramsey-Turán theory, On vertex-induced weighted Turán problems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Bipartite algebraic graphs without quadrilaterals, On even-cycle-free subgraphs of the doubled Johnson graphs, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, A short derivation for Turán numbers of paths, Forbidden paths and cycles in ordered graphs and matrices, On the rational Turán exponents conjecture, Improved bounds for the extremal number of subdivisions, In search of the densest subgraph, The Turán number of star forests, Counting sum-free sets in abelian groups, Forbidden configurations: boundary cases, Cycles of given lengths in hypergraphs, A new upper bound on extremal number of even cycles, Minimal Ramsey graphs on deleting stars for generalized fans and books, Inverting the Turán problem with chromatic number, Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions, Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs, On the maximal colorings of complete graphs without some small properly colored subgraphs, A note on stability for maximal \(F\)-free graphs, The Turán number of the square of a path, Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal, On some extremal problems on \(r\)-graphs, Ramsey numbers for cycles in graphs, On a valence problem in extremal graph theory, On the existence of triangulated spheres in 3-graphs, and related problems, Minimal colorings for properly colored subgraphs, A jump to the Bell number for hereditary graph properties, On Ramsey - Turan type theorems for hypergraphs, Extremal Theta-free planar graphs, Rainbow saturation, Planar Turán numbers of short paths, Graph cover-saturation, Non-jumping Turán densities of hypergraphs, Generalized outerplanar Turán number of short paths, Covering non-uniform hypergraphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, A hierarchy of randomness for graphs, A density Hales-Jewett theorem for matroids, A unified approach to hypergraph stability, Tight bounds for powers of Hamilton cycles in tournaments, Matroids denser than a clique, Almost-spanning subgraphs with bounded degree in dense graphs, A linear hypergraph extension of Turán's theorem, Star-critical Ramsey numbers involving large books, Inverse Turán numbers, Supersaturation for subgraph counts
