scientific article; zbMATH DE number 3232670
From MaRDI portal
Publication:5520566
zbMath0144.23302MaRDI QIDQ5520566
Alfréd Rényi, Vera T. Sós, Paul Erdős
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
\(C_4\)-free subgraphs with large average degree, A variation of a classical Turán-type extremal problem, The number of \(C_{2\ell}\)-free graphs, Certain particular families of graphicable algebras, Impossibility of order-revealing encryption in idealized models, On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\), Generalized rainbow Turán problems, Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals, On product representation of powers. I, Ramsey numbers based on \(C_ 5\)-decompositions, Some extremal results on hypergraph Turán problems, First-order network coherence in 5-rose graphs, The number of copies of \(K_{2,t+1}\) in a graph, The independence number for polarity graphs of even order planes, Forbidding multiple copies of forestable graphs, A graph-theoretic result for a model of neural computation, Color the cycles, Some extremal results on complete degenerate hypergraphs, Finite prime distance graphs and 2-odd graphs, Uniform hypergraphs containing no grids, Two-regular subgraphs of odd-uniform hypergraphs, On the radius of nonsplit graphs and information dissemination in dynamic networks, On the Turán number of forests, A note on eigenvalue bounds for independence numbers of non-regular graphs, On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Hamiltonian cycles with all small even chords, Some applications of Ramsey's theorem to additive number theory, When local and global clustering of networks diverge, On the coverings of graphs, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Regular separable graphs of minimum order with given diameter, On completely positive graphs and their complements, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, The fine structure of octahedron-free graphs, Diameter critical graphs, An approach to solving \(A^{k}=J-I\), Graphs whose every independent set has a common neighbour, On the sizes of graphs and their powers: the undirected case, Infinite friendship graphs with infinite parameters, On the independent domination polynomial of a graph, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, Configurations in projective planes and quadrilateral-star Ramsey numbers, Eigenvalue bounds for independent sets, On a Turán type problem of Erdős, New classes of extremal graphs with given bandwidth, Randić energy of specific graphs, Augmenting graphs to minimize the diameter, Shortcuts for the circle, A spectral version of Mantel's theorem, Bounding the number of hyperedges in friendship \(r\)-hypergraphs, Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs, Core-satellite graphs: clustering, assortativity and spectral properties, Bipartite algebraic graphs without quadrilaterals, On edges not in monochromatic copies of a fixed bipartite graph, Polarity graphs and Ramsey numbers for \(C_4\) versus stars, Maximum cardinality neighbourly sets in quadrilateral free graphs, A family of graphs that are determined by their normalized Laplacian spectra, Davenport-Schinzel theory of matrices, A neighborhood condition which implies the existence of a complete multipartite subgraph, Cycle-connected graphs, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, Switchings, extensions, and reductions in central digraphs, Dense graphs have \(K_{3,t}\) minors, On the two largest \(Q\)-eigenvalues of graphs, Graphs from projective planes, Ramsey graphs and block designs, Vector representations of graphs, The number of 2-dominating sets, and 2-domination polynomial of a graph, A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares, Steiner diameter, maximum degree and size of a graph, Some extremal results on 4-cycles, On the homogeneous algebraic graphs of large girth and their applications, Dominating sequences in graphs, On an extremal hypergraph problem related to combinatorial batch codes, Radius, diameter, and minimum degree, On the maximal colorings of complete graphs without some small properly colored subgraphs, Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs, Matchings and covers in hypergraphs, The maximum spectral radius of \(C_4\)-free graphs of given order and size, On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs, The maximum size of hypergraphs without generalized 4-cycles, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Hypergraphs in which all disjoint pairs have distinct unions, Some geometric structures and bounds for Ramsey numbers, Strengthening the Murty-Simon conjecture on diameter 2 critical graphs, Graphs without quadrilaterals, Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate, Polarities and \(2k\)-cycle-free graphs, Cycles of even length in graphs, One method for proving the impossibility of certain Moore graphs, Infinite generalized friendship graphs, On generalized Ramsey theory: The bipartite case, On the mutual visibility in Cartesian products and triangle-free graphs, Norm-graphs: Variations and applications, Tight bounds for powers of Hamilton cycles in tournaments, A new extremal property of Steiner triple-systems, Inverse Turán numbers, Intersecting designs from linear programming and graphs of diameter two, Optimal monomial quadratization for ODE systems, Wavelength routing in optical networks of diameter two, The spectral determinations of some classes of multicone graphs, On the roots of total domination polynomial of graphs, On the Decomposition of Graphs, On Turán exponents of bipartite graphs, Ramsey properties of algebraic graphs and hypergraphs, WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS, Multicolored set multipartite Ramsey numbers, Crux and Long Cycles in Graphs, Graphs of diameter 3 with the minimum number of edges, Unnamed Item, Unnamed Item, On Co-completek–partite Graph Valued Functions, On the extension of connected irregular (λ,μ)-graphs, A Hierarchy of Lower Bounds for Sublinear Additive Spanners, Some values of Ramsey numbers for \(C_4\) versus stars, A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem, On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs, A note on the maximum size of Berge-\( C_4\)-free hypergraphs, Forbidding \(K_{2,t}\) traces in triple systems, Uniformly Connected Graphs — A Survey, Steiner 4-diameter, maximum degree and size of a graph, An average degree condition for independent transversals, Bounds for two multicolor Ramsey numbers concerning quadrilaterals, The number of 4-cycles in a graph, An extremal graph problem, Unnamed Item, Ramsey numbers of the quadrilateral versus books, Edge-fault diameter of \(C_4\)-free graphs, Petals and books: The largest Laplacian spectral gap from 1, 4-cycles in mixing digraphs, Unnamed Item, Upper bounds on the extremal number of the 4‐cycle, Klein cordial trees and odd cyclic cordial friendship graphs, A note on projective norm graphs, Spectral radii of friendship graphs and their connected induced subgraphs, Ramsey non-goodness involving books, The number of multiplicative Sidon sets of integers, On min–max distance degree index, On sparse parity check matrices (extended abstract), Four-vertex traces of finite sets, Graphs with few paths of prescribed length between any two vertices, A note on 3‐partite graphs without 4‐cycles, On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition, Unnamed Item, Turán numbers of several bipartite graphs, On \(3\)-uniform hypergraphs avoiding a cycle of length four, Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, Doubling constants and spectral theory on graphs, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, Unnamed Item, Lovász, Vectors, Graphs and Codes, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Unnamed Item, Unnamed Item, Fine-grained Lower Bounds on Cops and Robbers, Модель эволюции распределений степеней вершин графов социальных сетей, On the spectral determinations of the connected multicone graphs, Counting configuration-free sets in groups, Unnamed Item, On the Turán number for the hexagon, Domination polynomial of clique cover product of graphs, Composition Markov chains of multinomial type, On the doubly connected domination polynomial of a graph, A generalization of Moore graphs of diameter two, Ramsey Graphs and Block Designs. I, On some extremal problems on \(r\)-graphs, Large cycles in graphs, Hypergraphs with Few Berge Paths of Fixed Length between Vertices, Independent Sets in Polarity Graphs, Unnamed Item, Intersection properties of finite sets, Bipartite Independence Number in Graphs with Bounded Maximum Degree, Turán numbers of theta graphs, A note on the Turán function of even cycles, On the extremal eccentric connectivity index of graphs, Notes on the combinatorial game: graph Nim, Exponent-critical primitive graphs and the Kronecker product, Some families of graphs with no nonzero real domination roots, Interlace polynomials of friendship graphs, Graphs, friends and acquaintances, Graph metric with no proper inclusion between lines, On the chromatic number of the Erdős-Rényi orthogonal polarity graph, Some constructions of $\lambda$-minimal graphs, Counting independent sets in graphs, The graphs with all but two eigenvalues equal to \(\pm 1\), On some parameters related to matching of graph powers, The regularity method for graphs with few 4‐cycles, ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS, Diameters and Eigenvalues
