On the theory of graphs
From MaRDI portal
Publication:5826301
DOI10.4064/cm-3-1-19-30zbMath0055.17004OpenAlexW947400629WikidataQ90158720 ScholiaQ90158720MaRDI QIDQ5826301
Publication date: 1954
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/210003
Related Items
Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star, On a rainbow extremal problem for color‐critical graphs, Extremal results for \(C_3^-\)-free signed graphs, On cliques in graphs, Extremal graphs for blow-ups of stars and paths, Clique-partitioned graphs, Turán-Ramsey theorems and simple asymptotically extremal structures, Multicolour Turán problems, Finite families of forbidden subgraphs for rainbow connection in graphs, A generalization of a Turán’s theorem about maximum clique on graphs, Über die in Graphen enthaltenen saturierten planaren Graphen, Chromaticity of the complements of paths and cycles, New bounds on the independence number of connected graphs, Intersection properties of boxes. I: An upper-bound theorem, A bibliography on chromatic polynomials, On extremal problems of graphs and generalized graphs, The number of triangles in a \(K_ 4\)-free graph, On some extremal problems in graph theory, Independent sets in regular graphs, Extremal graphs for blow-ups of keyrings, On unavoidable graphs, Graphentheoretische Extremalprobleme, Forbidding multiple copies of forestable graphs, Extremal graphs for odd-ballooning of paths and cycles, Size of weakly saturated graphs, The maximal size of the covering graph of a lattice, On the Turán number of forests, On vertex independence number of uniform hypergraphs, Stochastic packing integer programs with few queries, On an extremal problem concerning the theory of graphs, Extremal Numbers for Odd Cycles, Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I, Parallel selection, On maximal paths and circuits of graphs, An exact algorithm for the maximum clique problem, On maximally saturated graphs, On the lotto problem, On the maximal number of certain subgraphs in \(K_ r\)-free graphs, On induced saturation for paths, An improved lower bound on the independence number of a graph, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four, An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties, Intersection properties of boxes. II: Extremal families, 0-1 matrices with zero trace whose squares are 0-1 matrices, Quadripartite version of the Hajnal-Szemerédi theorem, Adjacency eigenvalues of graphs without short odd cycles, A spectral condition for odd cycles in non-bipartite graphs, Bounds on the number of complete subgraphs, Extensions of Turán's theorem on graphs, Extremal numbers for directed hypergraphs with two edges, A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints, A Turán-type theorem on chords of a convex polygon, On subspaces contained in subsets of finite homogeneous spaces, On subspaces contained in subsets of finite homogeneous spaces, Shifted products that are coprime pure powers, Three-graphs without two triples whose symmetric difference is contained in a third, Über ein Extremalproblem der Graphentheorie, The Turán number of star forests, Single subject incomplete designs for nonmetric multidimensional scaling, The Chromatic Number of Kneser Hypergraphs, The maximum number of q-cliques in a graph with no p-clique, Algorithmic Solution of Extremal Digraph Problems, Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints, Independence numbers of graphs and generators of ideals, On graphs which contain all small trees, On Turan hypergraphs, A Turan type problem for interval graphs, Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques, Extremal digraphs avoiding an orientation of the diamond, Le nombre minimal de colorations d'un hypergraphe k-chromatique, Generating hard and diverse test sets for NP-hard graph problems, Extremal digraphs avoiding an orientation of \(C_4\), Kanten-kritische Graphen mit der Zusammenhangszahl 2, On the density of subgraphs in a graph with bounded independence number, Convexity and a certain property \(P_ m\), On critical subgraphs of colour-critical graphs, The combinatorial structure of (\(m,n\))-convex sets, The Turań number of \(2P_7\), On some extremal problems on \(r\)-graphs, Note on Turán's graph, A generalization of a theorem of Turán, On some applications of graph theory. I, Turan's theorem for \(k\)-graphs, The number of graphs without forbidden subgraphs, Extremal problems for directed graphs, On an extremal problem in graph theory., Osculation vertices in arrangements of curves, On the existence of triangulated spheres in 3-graphs, and related problems, Spectral extrema of graphs: forbidden hexagon, Size in maximal triangle-free graphs and minimal graphs of diameter 2, Bivalent trees and forests or upper bounds for the probability of a union revisited, On disjointly representable sets, Induced subgraphs of given sizes, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, A hierarchy of randomness for graphs, Graph metric with no proper inclusion between lines, The maximum number of cliques in dense graphs, Point Partition Numbers and Girth, A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs, Extremal problems whose solutions are the blowups of the small Witt- designs, The maximum clique problem, Relations between degree-based graph invariants, Turán problems for integer-weighted graphs
