On a Ramsey type theorem
From MaRDI portal
Publication:2553974
DOI10.1007/BF02018669zbMath0242.05122OpenAlexW2045774391WikidataQ106084729 ScholiaQ106084729MaRDI QIDQ2553974
Publication date: 1972
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02018669
Related Items
A Ramsey‐type problem and the Turán numbers*, Problems and results in discrete mathematics, Induced subgraphs of Ramsey graphs with many distinct degrees, Tower Gaps in Multicolour Ramsey Numbers, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Combinatorics. Abstracts from the workshop held January 1--7, 2023, The oriented size Ramsey number of directed paths, Hypergraph Ramsey numbers of cliques versus stars, A bipartite version of the Erdős–McKay conjecture, Distinct degrees and homogeneous sets, The (t−1) $(t-1)$‐chromatic Ramsey number for paths, A lower bound for set‐coloring Ramsey numbers, The size Ramsey number of a directed path, Induced Subgraphs With Many Distinct Degrees, Ramsey numbers with prescribed rate of growth, Finding unavoidable colorful patterns in multicolored graphs, Ordered Ramsey numbers, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, Complementary Ramsey Numbers, Distinct degrees in induced subgraphs, Sizes of Induced Subgraphs of Ramsey Graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, A conjecture of Erdős on graph Ramsey numbers, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, Short proofs of some extremal results III, Ramsey-type theorems, Non-Ramsey graphs are \(c\log n\)-universal, On the number of homogeneous subgraphs of a graph, Extremal subgraphs for two graphs, An upper bound for the restricted online Ramsey number, Proof of a conjecture on induced subgraphs of Ramsey graphs, Large cliques and independent sets all over the place, Edge-colored complete graphs with precisely colored subgraphs, On Erdős-Rado numbers, Ramsey numbers of books and quasirandomness
Cites Work
