On the structure of linear graphs
From MaRDI portal
Publication:5842850
DOI10.1090/S0002-9904-1946-08715-7zbMATH Open0063.01277OpenAlexW2111007781WikidataQ29395510 ScholiaQ29395510MaRDI QIDQ5842850FDOQ5842850
Authors: A. H. Stone, P. Erdős 
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
Recommendations
Cited In (only showing first 100 items - show all)
- On a valence problem in extremal graph theory
- Ramsey numbers for cycles in graphs
- On finite simple groups and Kneser graphs.
- On the Chromatic Thresholds of Hypergraphs
- Maximum planar subgraphs in dense graphs
- The extremal function for partial bipartite tilings
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Pan-\(H\)-linked graphs
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Excluding induced subgraphs. II: Extremal graphs
- Independent sets in hypergraphs
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Extremal results for random discrete structures
- On the existence of triangulated spheres in 3-graphs, and related problems
- Non-jumping numbers for 4-uniform hypergraphs
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- The maximum edit distance from hereditary graph properties
- Unit distances and diameters in Euclidean spaces
- Generating non-jumping numbers recursively
- On jumping densities of hypergraphs
- Minimal colorings for properly colored subgraphs
- Correlation among runners and some results on the lonely runner conjecture
- Hypergraphs do not jump
- Two results on Ramsey-Turán theory
- On families of subsets with a forbidden subposet
- On the Turán number of some ordered even cycles
- A linear hypergraph extension of Turán's theorem
- Some extremal results on hypergraph Turán problems
- On a conjecture of Erdős and Simonovits: even cycles
- On the Turán number of forests
- Turán numbers of bipartite graphs plus an odd cycle
- A version of the Loebl-Komlós-Sós conjecture for skew trees
- On the algebraic and topological structure of the set of Turán densities
- On possible Turán densities
- A note on the jumping constant conjecture of Erdős
- The maximal length of a gap between \(r\)-graph Turán densities
- The number of \(C_{2\ell}\)-free graphs
- Title not available (Why is that?)
- Edge-decompositions of graphs with high minimum degree
- The Zero Forcing Number of Graphs
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- Packings of graphs and applications to computational complexity
- Hypergraphs do jump
- An Upper Bound on Zarankiewicz' Problem
- Extremal problems on set systems
- Blow-up lemma
- Turán number of bipartite graphs with no \(K_{t,t}\)
- The number of \(K_{m,m}\)-free graphs
- Extremal graphs for intersecting cliques
- The codegree threshold for 3-graphs with independent neighborhoods
- Davenport-Schinzel theory of matrices
- Bandwidth theorem for random graphs
- On Ramsey - Turan type theorems for hypergraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- A density Hales-Jewett theorem for matroids
- On extremal problems of graphs and generalized graphs
- Embedding tetrahedra into quasirandom hypergraphs
- Unique low rank completability of partially filled matrices
- Estimating and understanding exponential random graph models
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Title not available (Why is that?)
- On some extremal problems on \(r\)-graphs
- Co-degree density of hypergraphs
- The early evolution of the \(H\)-free process
- A spectral Erdős-Stone-Bollobás theorem
- Universal and unavoidable graphs
- Supersaturated graphs and hypergraphs
- Extremal results in sparse pseudorandom graphs
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- On the densities of cliques and independent sets in graphs
- Extremal problems concerning transformations of the set of edges of the complete graph
- Inverting the Turán problem with chromatic number
- On maximal paths and circuits of graphs
- Forbidden paths and cycles in ordered graphs and matrices
- Stability results for random discrete structures
- On the KŁR conjecture in random graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Title not available (Why is that?)
- Counting sum-free sets in abelian groups
- Incidence Relations in Unicoherent Spaces
- On the Ramsey-Turán numbers of graphs and hypergraphs
- More results on Ramsey-Turán type problems
- Color the cycles
- Double-normal pairs in space
- Turán's extremal problem in random graphs: Forbidding odd cycles
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Title not available (Why is that?)
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- Maker-Breaker games on randomly perturbed graphs
- Graphs with few paths of prescribed length between any two vertices
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Almost-spanning subgraphs with bounded degree in dense graphs
- Random algebraic construction of extremal graphs
- The Turán number of star forests
- Some exact results for generalized Turán problems
- Turán numbers of bipartite subdivisions
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
This page was built for publication: On the structure of linear graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5842850)
