Results 131 to 140 of about 7,928 (143)
Some of the next articles are maybe not open access.
Anti-Ramsey problems for cycles
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Jiale, Lu, Mei, Liu, Ke
openaire +1 more source
Combinatorica, 2002
The Turán number \(t_p(n)\) is the maximum size of a graph with \(n\) vertices without subgraphs isomorphic to the complete graph \(K_p\). A subgraph of \(K_n\) is called totally multicoloured (with respect to an edge colouring of \(K_n\)) if all edges have different colours. Let \(h_r(n)\) be the minimum number of colours so that any edge colouring of
Montellano-Ballesteros, J. J. +1 more
openaire +1 more source
The Turán number \(t_p(n)\) is the maximum size of a graph with \(n\) vertices without subgraphs isomorphic to the complete graph \(K_p\). A subgraph of \(K_n\) is called totally multicoloured (with respect to an edge colouring of \(K_n\)) if all edges have different colours. Let \(h_r(n)\) be the minimum number of colours so that any edge colouring of
Montellano-Ballesteros, J. J. +1 more
openaire +1 more source
Bipartite anti‐Ramsey numbers of cycles
Journal of Graph Theory, 2004AbstractWe determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs.
Axenovich, Maria +2 more
openaire +2 more sources
An Anti-Ramsey Theorem on Cycles
Graphs and Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Montellano-Ballesteros, J. J. +1 more
openaire +2 more sources
On a Generalized Anti-Ramsey Problem
Combinatorica, 2001For integers \(p,q_1,q_2 > 0\), a coloring of \(E(K_n)\) is called \((p,q_1,q_2)\)-coloring if at least \(q_1\) and at most \(q_2\) different colors appear at the edges of every \(K_p \subseteq K_n\). \(R(n,p,q_1,q_2)\) denotes the maximum number of colors in a \((p,q_1,q_2)\)-coloring of \(E(K_n)\). The authors prove several bounds, especially for \(R(
Axenovich, Maria, Kündgen, André
openaire +2 more sources
Local Anti-Ramsey Numbers of Graphs
Combinatorics, Probability and Computing, 2003A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.
Axenovich, Maria +2 more
openaire +1 more source
Graphs and Combinatorics, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Rainbow Arithmetic Progressions and Anti-Ramsey Results
Combinatorics, Probability and Computing, 2003The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic ...
Jungić, Veselin +4 more
openaire +1 more source
An Anti-Ramsey Theorem on Diamonds
Graphs and Combinatorics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An Anti-Ramsey Theorem of k-Restricted Edge-Cuts
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego González-Moreno +2 more
openaire +1 more source