Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Bar��t, J��nos"'
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1587d80d7f50054e2cebcc92d33c43d
Autor:
Bar��t, J��nos
We determine the maximum number of edges in a $K_4$-minor-free $n$-vertex graph of girth $g$, when $g = 5$ or $g$ is even. We argue that there are many different $n$-vertex extremal graphs, if $n$ is even and $g$ is odd.
to appear in Periodica M
to appear in Periodica M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6bfcda6fb0abb7c123d5cd71f57fffb
Autor:
Bar��t, J��nos, T��th, G��za
A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is, maximal pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7acfca2d21c56dbc79b2db108c2ad173
Autor:
Bar��t, J��nos, T��th, G��za
The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing number drops
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92f2ab53a01791aafa9379f12cc195c1
Autor:
Bar��t, J��nos
Erd��s and Lov��sz noticed that an $r$-uniform intersecting hypergraph $H$ with maximal covering number, that is $��(H)=r$, must have at least $\frac{8}{3}r-3$ edges. There has been no improvement on this lower bound for 45 years. We try
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::161de74bd075032f686c5722b4338fd7
Autor:
Bar��t, J��nos
Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red subgraph has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d94496085afd8812d3affc74d8fcac26
Autor:
Bar��t, J��nos, Nagy, Zolt��n L��r��nt
We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order $n$ is equivalent to a proper edge-coloring of $K_{n,n}$. A transversal corresponds to a multicolored perfect matching.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03fa095dc6ebb5b8de88e40ec21d4087
Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the hypergraph is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8d4d5e8aea5c281b0911a89a0d71469
http://arxiv.org/abs/1605.06361
http://arxiv.org/abs/1605.06361
Autor:
Bar��t, J��nos, T��th, G��za
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only $\frac{45}{17}n +
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5941caf6eff5e54b9394d6c6bd9e2c3
Autor:
Bar��t, J��nos, Gerbner, D��niel
We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Bar��t and Thomassen: for each tree $T$, there exists a natural number $k_T$ such that if $G$ is a $k_T$-edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6ceddb4b45471e188f119c3d133b65e