Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
From MaRDI portal
Publication:5589119
DOI10.1137/0118004zbMath0193.53103OpenAlexW2155551829WikidataQ105585493 ScholiaQ105585493MaRDI QIDQ5589119
Publication date: 1970
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0118004
Related Items (74)
Partition properties of q-hypergraphs ⋮ Large triangle-free subgraphs in graphs without \(K_ 4\) ⋮ Degree Ramsey Numbers of Graphs ⋮ Towards the 0-statement of the Kohayakawa-Kreuter conjecture ⋮ A consistent edge partition theorem for infinite graphs ⋮ A Folkman Linear Family ⋮ On induced Folkman numbers ⋮ Globally sparse vertex‐ramsey graphs ⋮ Random graphs with monochromatic triangles in every edge coloring ⋮ Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\) ⋮ Small minimal $(3, 3)$-Ramsey graphs ⋮ Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$ ⋮ A note on restricted vertex Ramsey numbers ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ Three hundred million points suffice ⋮ The complexity of generalized graph colorings ⋮ Degree Ramsey numbers for even cycles ⋮ Some recent results on Ramsey-type numbers ⋮ On globally sparse Ramsey graphs ⋮ Chromatic number is Ramsey distinguishing ⋮ Unnamed Item ⋮ A numerical method based on the moving mesh for the solving of a mathematical model of the avascular tumor growth ⋮ Finding Folkman Numbers via MAX CUT Problem ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ On some generalized vertex Folkman numbers ⋮ On some edge Folkman numbers, small and large ⋮ Chromatic vertex Folkman numbers ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ On the triangle vertex Folkman numbers ⋮ Partition theorems for parameter systems and graphs ⋮ The Ramsey theory of the universal homogeneous triangle-free graph ⋮ Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs ⋮ Some remarks on vertex Folkman numbers for hypergraphs ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ Simple proof of the existence of restricted Ramsey graphs by means of a partite construction ⋮ Unnamed Item ⋮ On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers ⋮ Splittings and Ramsey properties of permutation classes ⋮ Ramsey-type properties of relational structures ⋮ Degree bipartite Ramsey numbers ⋮ Graph properties and hypergraph colourings ⋮ A multiplicative inequality for vertex Folkman numbers ⋮ Online Ramsey Games in Random Graphs ⋮ On multicolour noncomplete Ramsey graphs of star graphs ⋮ Generalized local colorings of graphs ⋮ An exponential-type upper bound for Folkman numbers ⋮ On Ramsey graphs without bipartite subgraphs ⋮ On the nonexistence of some generalized Folkman numbers ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Restricted Ramsey configurations ⋮ The Ramsey property for graphs with forbidden complete subgraphs ⋮ The chromatic number of infinite graphs - A survey ⋮ Asymmetric Ramsey properties of random graphs involving cliques ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ On Ramsey-type positional games ⋮ Partitions of finite relational and set systems ⋮ New Upper Bound on Vertex Folkman Numbers ⋮ A Ramsey type problem concerning vertex colourings ⋮ An efficient container lemma ⋮ EPPA for two-graphs and antipodal metric spaces ⋮ Unnamed Item ⋮ A note on upper bounds for some generalized Folkman numbers ⋮ The subchromatic number of a graph ⋮ On Ramsey numbers and \(K_ r\)-coloring of graphs ⋮ On a bound of Graham and Spencer for a graph-colouring constant ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ Embedding Graphs into Colored Graphs ⋮ Two proofs of the Ramsey property of the class of finite hypergraphs ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Sparse Ramsey graphs ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ ⋮ Coloring of universal graphs
This page was built for publication: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
