scientific article; zbMATH DE number 3258067
From MaRDI portal
Publication:5543308
zbMath0161.20501MaRDI QIDQ5543308
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (99)
Turán numbers for hypergraph star forests ⋮ Sparse hop spanners for unit disk graphs ⋮ On the Erdős–Sós conjecture for trees with bounded degree ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Gaps in the saturation spectrum of trees ⋮ Source-wise round-trip spanners ⋮ Generalized rainbow Turán problems ⋮ Spanners for bounded tree-length graphs ⋮ Singular Turán numbers and worm-colorings ⋮ Turán problems and shadows. II: Trees ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Exact solution of some Turán-type problems ⋮ The Erdös-Sós conjecture for graphs of girth 5 ⋮ Deterministic improved round-trip spanners ⋮ Extremal problems for multigraphs ⋮ An Erdős-Gallai-type theorem for keyrings ⋮ Uniform hypergraphs containing no grids ⋮ On the Turán number of forests ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ The extremal graph problem of the icosahedron ⋮ Communication-efficient distributed graph clustering and sparsification under duplication models ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Ramsey goodness of trees in random graphs ⋮ Radius, girth and minimum degree ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Degree conditions on copies of forests in graphs ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Unnamed Item ⋮ Ramsey numbers involving large dense graphs and bipartite Turán numbers ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Some exact results for regular Turán problems for all large orders ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Turán numbers for odd wheels ⋮ On the Turán number of the hypercube ⋮ Online Spanners in Metric Spaces ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem ⋮ On Turán problems with bounded matching number ⋮ On an extremal problem for locally sparse multigraphs ⋮ Generalized Turán problems for even cycles ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ Unnamed Item ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ Degree powers in graphs with a forbidden forest ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ A condition for a graph to contain \(k\)-matching. ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ On the VC-dimension of unique round-trip shortest path systems ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s ⋮ Simple Distributed Spanners in Dense Congest Networks ⋮ The Erdős-Sós conjecture for spiders ⋮ Linear Turán numbers of acyclic triple systems ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Cycles in graphs of fixed girth with large size ⋮ An Erdős-Gallai type theorem for vertex colored graphs ⋮ Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners ⋮ Streaming algorithm for graph spanners-single pass and constant processing time per edge ⋮ On subspaces contained in subsets of finite homogeneous spaces ⋮ Graph minor hierarchies ⋮ Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions ⋮ Unnamed Item ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ On graphs which contain all small trees ⋮ Ramsey partitions and proximity data structures ⋮ A fast algorithm for source-wise round-trip spanners ⋮ Fault-tolerant approximate shortest-path trees ⋮ On equitable colorings of hypergraphs ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Unit distances and diameters in Euclidean spaces ⋮ Multi-color Ramsey numbers of even cycles ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ On some extremal problems on \(r\)-graphs ⋮ Triple systems with no three triples spanning at most five points ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Degree Conditions for Embedding Trees ⋮ Distance-Preserving Graph Contractions ⋮ Extremal Numbers of Cycles Revisited ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Turán numbers of theta graphs ⋮ Constructing light spanners deterministically in near-linear time ⋮ Distributed Spanner Approximation ⋮ Some remarks on packing trees ⋮ On a Turán-type hypergraph problem of Brown, Erdős and T. Sós ⋮ Distance-Preserving Graph Contractions ⋮ Cycles of even length in graphs ⋮ Induced subgraphs of given sizes ⋮ Unnamed Item ⋮ Degree conditions for forests in graphs ⋮ Supersaturation for subgraph counts ⋮ Lasserre integrality gaps for graph spanners and related problems
This page was built for publication:
