scientific article; zbMATH DE number 3188526
From MaRDI portal
Publication:5724802
zbMath0116.01202MaRDI QIDQ5724802
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Ramsey numbers of fans and large books, Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko, Large generalized books are \(p\)-good, The maximal number of induced complete bipartite graphs, Ramsey numbers of a fixed odd-cycle and generalized books and fans, Some exact results for generalized Turán problems, On a conjecture of Erdős for multiplicities of cliques, Generalized rainbow Turán problems, Generalized Turán number for linear forests, Triangles in space or building (and analyzing) castles in the air, Non-bipartite \(k\)-common graphs, Some corollaries of a theorem of Whitney on the chromatic polynomial, On graphs in which any pair of colour classes but one induces a tree, The number of triangles in a \(K_ 4\)-free graph, Combinatorial theorems in sparse random sets, Multiplicities of subgraphs, Upper tails via high moments and entropic stability, Complete subgraphs in connected graphs and its application to spectral moment, The maximum number of paths of length four in a planar graph, The number of triangles is more when they have no common vertex, On the structure and chromaticity of graphs in which any two colour classes induce a tree, Graph products and monochromatic multiplicities, Generalized planar Turán numbers, Generalized rainbow Turán numbers of odd cycles, On the abstract chromatic number and its computability for finitely axiomatizable theories, Some extremal results on complete degenerate hypergraphs, On the distance of databases, The maximum number of cliques in graphs without long cycles, Independence number of graphs with a prescribed number of cliques, Maximizing the number of independent sets of fixed size in connected graphs with given independence number, Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, Structure and supersaturation for intersecting families, Many triangles with few edges, Turán problems for \(k\)-geodetic digraphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, The maximum number of complete subgraphs in a graph with given maximum degree, The maximum number of cliques in hypergraphs without large matchings, On the number of subgraphs of prescribed type of graphs with a given number of edges, Extremals of functions on graphs with applications to graphs and hypergraphs, Generating all subsets of a finite set with disjoint unions, Subgraph densities in \(K_r\)-free graphs, Triangles in graphs without bipartite suspensions, On the number of complete subgraphs contained in certain graphs, Some exact results of the generalized Turán numbers for paths, On the Ramsey multiplicity of complete graphs, Counting substructures. I: Color critical graphs, Extremal results in sparse pseudorandom graphs, Edges not in any monochromatic copy of a fixed graph, On the number of \(K_4\)-saturating edges, Monochromatic triangles in three-coloured graphs, Maximising the number of cycles in graphs with forbidden subgraphs, On finite Ramsey numbers, On the maximal number of certain subgraphs in \(K_ r\)-free graphs, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, Blowup Ramsey numbers, Counting substructures. II: Hypergraphs, The chromatic uniqueness of complete bipartite graphs, Bounds on graph eigenvalues. II, A note on the inducibility of 4-vertex graphs, Independent sets in graphs, Many cliques with few edges and bounded maximum degree, Supersaturation problem for color-critical graphs, General lemmas for Berge-Turán hypergraph problems, Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, On the complexity of fixed parameter clique and dominating set, Some sharp results on the generalized Turán numbers, Rainbow triangles and cliques in edge-colored graphs, On the discrepancy between two Zagreb indices, On the maximum number of cliques in a graph, New short proofs to some stability theorems, Flag complexes and homology, Minimal Ramsey graphs on deleting stars for generalized fans and books, Some results on \(k\)-Turán-good graphs, Star-critical Ramsey numbers for large generalized fans and books, Generalized Turán number of even linear forests, The maximal number of induced \(r\)-partite subgraphs, A problem of Erdős on the minimum number of \(k\)-cliques, Cycles in graphs and functional inequalities, A new Turán-type theorem for cliques in graphs, Counting copies of a fixed subgraph in \(F\)-free graphs, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, Generalized Turán problems for disjoint copies of graphs, Threshold Ramsey multiplicity for paths and even cycles, Two path extremal graphs and an application to a Ramsey-type problem, Supersaturated graphs and hypergraphs, The maximum number of triangles in a \(K_4\)-free graph, The number of complete subgraphs of equi-partite graphs, Generalized outerplanar Turán number of short paths, The maximum number of stars in a graph without linear forest, Ramsey numbers of books and quasirandomness, Generalized Turán densities in the hypercube, The feasible region of induced graphs, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, Counting cliques in 1-planar graphs, Star-critical Ramsey numbers involving large books, On a Paley-type graph on \({\mathbb{Z}}_n\), On the number of certain subgraphs contained in graphs with a given number of edges, Supersaturation for subgraph counts, On tripartite common graphs, Threshold Ramsey multiplicity for odd cycles, Planar Turán Number of the 6-Cycle, Generalized Ramsey theory for graphs, Extremal problems of double stars, Combinatorics. Abstracts from the workshop held January 1--7, 2023, On a generalization of the spectral Mantel's theorem, On supersaturation and stability for generalized Turán problems, On a generalized Erdős–Rademacher problem, The maximum number of paths of length three in a planar graph, On Two Problems in Ramsey--Turán Theory, Toward characterizing locally common graphs, Refinement on Spectral Turán’s Theorem, Induced Turán problems and traces of hypergraphs, The upper tail problem for induced 4‐cycles in sparse random graphs, Linear configurations containing 4-term arithmetic progressions are uncommon, A Property on Monochromatic Copies of Graphs Containing a Triangle, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Common graphs with arbitrary connectivity and chromatic number, Every graph is eventually Turán-good, Number of complete subgraphs of peisert graphs and finite field hypergeometric functions, Extended commonality of paths and cycles via Schur convexity, Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\), Prominent examples of flip processes, On a common-extendable, non-Sidorenko linear system, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman, Universality of Graphs with Few Triangles and Anti-Triangles, Counting substructures and eigenvalues. I: Triangles, Many \(T\) copies in \(H\)-free graphs, The number of $4$-cycles and the cyclomatic number of a finite simple graph, A new generalization of the Erdős-Ko-Rado theorem, Induced Turán Numbers, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, Unnamed Item, Supersaturation problem for the bowtie, Anti-Ramsey Multiplicities, Many H-Copies in Graphs with a Forbidden Tree, Many \(T\) copies in \(H\)-free graphs, On the Profile of Multiplicities of Complete Subgraphs, Books versus Triangles at the Extremal Density, Short proofs of some extremal results III, Ramsey Numbers Involving Large Books
