Results 1 to 10 of about 7,928 (143)
Anti-Ramsey Hypergraph Numbers [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj +2 more sources
Anti-Ramsey theory on complete bipartite graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +2 more sources
Anti-Ramsey numbers for disjoint copies of graphs [PDF]
Opuscula Mathematica, 2017 A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph \(G\) and a positive integer \(n\), the anti-Ramsey number \(ar(n,G)\) is the maximum number of colors in an edge-coloring of \(K_n\) with no ...
Izolda Gorgol, Agnieszka Görlich
doaj +1 more source
On Mf-Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2022 An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v.
Ivančo Jaroslav, Onderko Alfréd
doaj +1 more source
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
Theory and Applications of Graphs, 2014 In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs.
Shinya Fujita +3 more
doaj +1 more source
Avoiding rainbow 2-connected subgraphs
Open Mathematics, 2017 While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to ...
Gorgol Izolda
doaj +1 more source
Some Ramsey- and anti-Ramsey-type results in combinatorial number theory and geometry [PDF]
, 2015 A szerző nem járult hozzá nyilatkozatában a dolgozat nyilvánosságra ...
Borbély, József
core +1 more source
Anti-Powers in Infinite Words [PDF]
, 2018 In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct ...
Fici, Gabriele +3 more
core +3 more sources
Brazilian Journal of Anesthesiology, 2016 Background and objectives: Nonsteroidal anti-inflammatory drugs (NSAIDs) are frequently used to control arthroscopic pain. Addition of oral effective opioid “codeine” to NSAIDs may be more effective and decrease parenteral opioid consumption in the ...
Cagla Bali +6 more
doaj +3 more sources
Orientations making k-cycles cyclic [PDF]
, 2015 We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$.
Helle, Zita, Simonyi, Gábor
core +2 more sources