Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
From MaRDI portal
Publication:5589119
DOI10.1137/0118004zbMath0193.53103WikidataQ105585493 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
Globally sparse vertex‐ramsey graphs, Random graphs with monochromatic triangles in every edge coloring, New Upper Bound on Vertex Folkman Numbers, On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number, Sparse Ramsey graphs, A multiplicative inequality for vertex Folkman numbers, On multicolour noncomplete Ramsey graphs of star graphs, An almost quadratic bound on vertex Folkman numbers, Coloring of universal graphs, Partition properties of q-hypergraphs, Large triangle-free subgraphs in graphs without \(K_ 4\), Three hundred million points suffice, Partition theorems for parameter systems and graphs, Simple proof of the existence of restricted Ramsey graphs by means of a partite construction, Ramsey-type properties of relational structures, Graph properties and hypergraph colourings, Generalized local colorings of graphs, On Ramsey graphs without bipartite subgraphs, Restricted Ramsey configurations, The Ramsey property for graphs with forbidden complete subgraphs, Partitions of finite relational and set systems, A Ramsey type problem concerning vertex colourings, A consistent edge partition theorem for infinite graphs, A note on restricted vertex Ramsey numbers, The existence of uniquely \(-G\) colourable graphs, On the triangle vertex Folkman numbers, The subchromatic number of a graph, Two proofs of the Ramsey property of the class of finite hypergraphs, The complexity of generalized graph colorings, The chromatic number of infinite graphs - A survey, On Ramsey numbers and \(K_ r\)-coloring of graphs, On a bound of Graham and Spencer for a graph-colouring constant, Asymmetric Ramsey properties of random graphs involving cliques, On Ramsey-type positional games, Finding Folkman Numbers via MAX CUT Problem, Online Ramsey Games in Random Graphs, Unnamed Item, Embedding Graphs into Colored Graphs, ON UNIQUELY -G k-COLOURABLE GRAPHS, Unnamed Item
