On Sets of Acquaintances and Strangers at any Party
From MaRDI portal
Publication:3267416
DOI10.2307/2310464zbMath0092.01305OpenAlexW4242431887WikidataQ105723238 ScholiaQ105723238MaRDI QIDQ3267416
Publication date: 1959
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2310464
Related Items
Large triangle-free subgraphs in graphs without \(K_ 4\), Maximizing the sum of the squares of the degrees of a graph, About triangles in a graph and its complement, Acyclic subgraphs with high chromatic number, A note on Ramsey numbers with two parameters, Proportional graphs, Minimizing cycles in tournaments and normalized \(q\)-norms, The step Sidorenko property and non-norming edge-transitive graphs, On a conjecture of Erdős for multiplicities of cliques, On multiplicity of triangles, Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs, Exact moments of the Sachdev-Ye-Kitaev model up to order \(1/N^2\), Non-Three-Colourable Common Graphs Exist, Subgraph counting identities and Ramsey numbers, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, Non-bipartite \(k\)-common graphs, A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs, The clique density theorem, Mantel's theorem for random graphs, A Theorem on Reconstruction of Random Graphs, Multiplicities of subgraphs, Small minimal $(3, 3)$-Ramsey graphs, New upper bound formulas with parameters for Ramsey numbers, A path forward: tropicalization in extremal combinatorics, Bounds for degree-based network entropies, On the local structure of oriented graphs -- a case study in flag algebras, On the density of a graph and its blowup, Graph products and monochromatic multiplicities, Some recent results on Ramsey-type numbers, Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, On the exact maximum induced density of almost all graphs and their inducibility, Finding Folkman Numbers via MAX CUT Problem, The minimum number of triangles in graphs of given order and size, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, On some edge Folkman numbers, small and large, The maximal number of 3-term arithmetic progressions in finite sets in different geometries, Some chemical indices related to the number of triangles, Graph theory. Abstracts from the workshop held January 2--8, 2022, On the number of complete subgraphs contained in certain graphs, Monochromatic triangles in three colours, On the Minimal Density of Triangles in Graphs, On the Ramsey multiplicity of complete graphs, Extremal results in sparse pseudorandom graphs, On the number of edges not covered by monochromatic copies of a fixed graph., Strong forms of stability from flag algebra calculations, Two-colorings with many monochromatic cliques in both colors, Monochromatic triangles in three-coloured graphs, Strongly regular graphs and finite Ramsey theory, On finite Ramsey numbers, On the KŁR conjecture in random graphs, Blowup Ramsey numbers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A note on Ramsey numbers for Berge-\(G\) hypergraphs, On the number of monotone sequences, Graph properties and hypergraph colourings, On Perfect Matchings and Tilings in Uniform Hypergraphs, A note on the inducibility of 4-vertex graphs, Extremal problems and results related to Gallai-colorings, On edges not in monochromatic copies of a fixed bipartite graph, Extremality of degree-based graph entropies, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, The critical window for the classical Ramsey-Turán problem, On the Hamiltonicity of triple systems with high minimum degree, On the minimum number of monochromatic generalized Schur triples, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, The maximum number of induced open triangles in graphs of a given order, \((-2)\)-monohemimorphic graphs, Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble, Unnamed Item, Hamilton cycles in hypergraphs below the Dirac threshold, On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, Frustrated triangles, Dense neighbourhoods and Turan's theorem, On the Profile of Multiplicities of Complete Subgraphs, Short proofs of some extremal results III, Exact Lower Bounds for Monochromatic Schur Triples and Generalizations, Using Ramsey theory to measure unavoidable spurious correlations in big data, New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\), Cycles in graphs and functional inequalities, On the number of homogeneous subgraphs of a graph, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, An upper bound for the Ramsey number M(5,4), Triangles in self-complementary graphs, Estimating the Szeged index, Generalized Ramsey theory for graphs. I: Diagonal numbers, Many disjoint triangles in co-triangle-free graphs, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, Cycles of length three and four in tournaments, Threshold Ramsey multiplicity for paths and even cycles, On generalized Schur numbers of the equation \(x+ay=z\), On multiplicity of quadrilaterals in complete graphs, An upper bound on the sum of squares of degrees in a graph, Packing Triangles in Regular Tournaments, Ramsey numbers of books and quasirandomness, Cycles of a given length in tournaments, The feasible region of induced graphs, Bounding Monochromatic Triangles Using Squares, A Ramsey variant of the Brown–Erdős–Sós conjecture, Triangles in a complete chromatic graph with three colors, On a Paley-type graph on \({\mathbb{Z}}_n\), Subgraph densities in a surface, On tripartite common graphs, Generalized Ramsey theory for graphs, Locally common graphs, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Toward characterizing locally common graphs, Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture, Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles, Edges Not Covered by Monochromatic Bipartite Graph, Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, 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, Number of complete subgraphs of peisert graphs and finite field hypergeometric functions, Extended commonality of paths and cycles via Schur convexity, On a common-extendable, non-Sidorenko linear system, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Universality of Graphs with Few Triangles and Anti-Triangles, On the Lower Tail Variational Problem for Random Graphs, String graphs and incomparability graphs, Undecidability of linear inequalities in graph homomorphism densities, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, Asymmetric graphs, The Inducibility of Graphs on Four Vertices, Supersaturation problem for the bowtie, On the densities of cliques and independent sets in graphs, Flag algebras, Anti-Ramsey Multiplicities, On the 3‐Local Profiles of Graphs, A geometric theory for hypergraph matching, On the maximum number of open triangles in graphs with the same number of vertices and edges
