Výsledky vyhledávání - "Prorok, Magdalena"

Report

On 3-colourability of $(bull, H)$-free graphs

Autor: Hodur, Nadzieja, Pilśniak, Monika, Prorok, Magdalena, Schiermeyer, Ingo

The $3$-colourability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where $bull$ is the graph consisting of $K_3$ with two pendant edges attached to two of its vertices. In this paper we study $3$-colo

Externí odkaz: http://arxiv.org/abs/2404.12515

Zobrazit plný text záznamu

Report

Directed graphs without rainbow stars

Autor: Gerbner, Daniel, Grzesik, Andrzej, Palmer, Cory, Prorok, Magdalena

In a rainbow version of the classical Tur\'an problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determine the minimum number of edges in each color which guarantees existen

Externí odkaz: http://arxiv.org/abs/2402.01028

Zobrazit plný text záznamu

Report

Majority distinguishing edge coloring

Autor: Gorzkowska, Aleksandra, Prorok, Magdalena

We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is a distinguishing coloring if for every non-trivial automorphism at lea

Externí odkaz: http://arxiv.org/abs/2312.05564

Zobrazit plný text záznamu

Report

The dimension of the region of feasible tournament profiles

Autor: Kral, Daniel, Lamaison, Ander, Prorok, Magdalena, Shu, Xichao

Erd\H os, Lov\'asz and Spencer showed in the late 1970s that the dimension of the region of $k$-vertex graph profiles, i.e., the region of feasible densities of $k$-vertex graphs in large graphs, is equal to the number of non-trivial connected graphs

Externí odkaz: http://arxiv.org/abs/2310.19482

Zobrazit plný text záznamu

Report

Directed graphs without rainbow triangles

Autor: Babiński, Sebastian, Grzesik, Andrzej, Prorok, Magdalena

One of the most fundamental results in graph theory is Mantel's theorem which determines the maximum number of edges in a triangle-free graph of order $n$. Recently a colorful variant of this problem has been solved. In such a variant we consider $c$

Externí odkaz: http://arxiv.org/abs/2308.01461

Zobrazit plný text záznamu