Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Barát, János"'
Autor:
Barát, János, Cambie, Stijn, Hahn, Geňa, Mattiolo, Davide, Onderko, Alfréd, Schiermeyer, Ingo, Tuza, Zsolt
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of
Externí odkaz:
http://arxiv.org/abs/2411.10046
Assume that $R_1,R_2,\dots,R_t$ are disjoint parallel lines in the plane. A $t$-interval (or $t$-track interval) is a set that can be written as the union of $t$ closed intervals, each on a different line. It is known that pairwise intersecting $2$-i
Externí odkaz:
http://arxiv.org/abs/2408.04308
In a graph $G$, the $2$-neighborhood of a vertex set $X$ consists of all vertices of $G$ having at least $2$ neighbors in $X$. We say that a bipartite graph $G(A,B)$ satisfies the double Hall property if $|A|\geq2$, and every subset $X \subseteq A$ o
Externí odkaz:
http://arxiv.org/abs/2310.02909
Autor:
Barát, János, Blázsik, Zoltán L.
In an orientation $O$ of the graph $G$, an arc $e$ is deletable if and only if $O-e$ is strongly connected. For a $3$-edge-connected graph $G$, the Frank number is the minimum $k$ for which $G$ admits $k$ strongly connected orientations such that for
Externí odkaz:
http://arxiv.org/abs/2305.19050
Autor:
Barát, János, Blázsik, Zoltán L.
Let $G(V,E)$ be a finite, simple, isolate-free graph. Two disjoint sets $A,B\subset V$ form a total coalition in $G$, if none of them is a total dominating set, but their union $A\cup B$ is a total dominating set. A vertex partition $\Psi=\{C_1,C_2,\
Externí odkaz:
http://arxiv.org/abs/2301.09979
A set $S$ of vertices in a hypergraph is \textit{strongly independent} if every hyperedge shares at most one vertex with $S$. We prove a sharp result for the number of maximal strongly independent sets in a $3$-uniform hypergraph analogous to the Moo
Externí odkaz:
http://arxiv.org/abs/2211.14101
Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a remark by Erd\H{o}s and Rado that every 2-coloring of the edges of a
Externí odkaz:
http://arxiv.org/abs/2210.10135
Autor:
Barát, János, Blázsik, Zoltán L.
In an orientation $O$ of the graph $G$, the edge $e$ is deletable if and only if $O-e$ is strongly connected. For a $3$-edge-connected graph $G$, H\"orsch and Szigeti defined the Frank number as the minimum $k$ for which $G$ admits $k$ orientations s
Externí odkaz:
http://arxiv.org/abs/2209.08804
Publikováno v:
In Discrete Mathematics September 2024 347(9)
Autor:
Barát, János, Czett, Mátyás
The dichromatic number of a directed graph is at most 2, if we can 2-color the vertices such that each monochromatic part is acyclic. An oriented graph arises from a graph by orienting its edges in one of the two possible directions. We study oriente
Externí odkaz:
http://arxiv.org/abs/2201.13161