Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
From MaRDI portal
Publication:1136781
DOI10.1016/0095-8956(79)90016-9zbMath0427.05052OpenAlexW2066360741MaRDI QIDQ1136781
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90016-9
Related Items (20)
On tripartite common graphs ⋮ Inducibility and universality for trees ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture ⋮ Non-bipartite \(k\)-common graphs ⋮ Multiplicities of subgraphs ⋮ Graph products and monochromatic multiplicities ⋮ Toward characterizing locally common graphs ⋮ Upper bounds for Ramsey numbers ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ On the Ramsey multiplicity of complete graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ On finite Ramsey numbers ⋮ A note on the inducibility of 4-vertex graphs ⋮ 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 Profile of Multiplicities of Complete Subgraphs ⋮ Cycles in graphs and functional inequalities ⋮ Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal ⋮ On the 3‐Local Profiles of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- An upper bound for the Ramsey number M(5,4)
- On Sets of Acquaintances and Strangers at any Party
- On Chromatic Graphs
- Blue-Empty Chromatic Graphs
- On the Riemann Hypothesis in Function-Fields
This page was built for publication: Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
