Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Structural theorem"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 531-558 (2021)
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided th
Externí odkaz:
https://doaj.org/article/c9181a69a9494fb2b8384543b356eeb0
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 531-558 (2021)
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef6905c907308e10313922456ed7d287
https://doaj.org/article/c9181a69a9494fb2b8384543b356eeb0
https://doaj.org/article/c9181a69a9494fb2b8384543b356eeb0
Autor:
Daniele Dona
Publikováno v:
Discrete & Computational Geometry. 66:1415-1428
We prove that a set $A$ of at most $q$ non-collinear points in the finite plane $\mathbb{F}_{q}^{2}$ spans at least $\approx\frac{|A|}{\sqrt{q}}$ directions: this is based on a lower bound contained in [FST13], which we prove again together with a di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f6e49f92cf99a52e43f8b3cf4ec55bf
https://doi.org/10.1007/s00454-021-00284-6
https://doi.org/10.1007/s00454-021-00284-6
Autor:
Ulla Karhumäki
We give a structural theorem for pseudofinite groups of finite centraliser dimension. As a corollary, we observe that there is no finitely generated pseudofinite group of finite centraliser dimension.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64a4ecb24a9cd67189441e35bd19dfd8
http://hdl.handle.net/10138/353234
http://hdl.handle.net/10138/353234
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩
Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩
We consider a cops and robber game where the cops are blocking edges of a graph, while the robber occupies its vertices. At each round of the game, the cops choose some set of edges to block and right after the robber is obliged to move to another ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41c8a9897a777e5deb3a69d9adcd623c
https://hal.archives-ouvertes.fr/hal-03001062/file/2009.03809.pdf
https://hal.archives-ouvertes.fr/hal-03001062/file/2009.03809.pdf
Autor:
Lenny Neyt
Publikováno v:
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
We study the space of tempered ultradistributions whose convolutions with test functions are all contained in a given translation-modulation invariant Banach space of ultradistributions. Our main result will be the first structural theorem for the af
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d13e10ae6ab3339e4b6969fa26bb45f9
https://doi.org/10.1016/j.jmaa.2021.125759
https://doi.org/10.1016/j.jmaa.2021.125759
Publikováno v:
Journal of Operator Theory. 80:125-152
In this article, we give explicit examples of maximal amenable subalgebras of the $q$-Gaussian algebras, namely, the generator subalgebra is maximal amenable inside the $q$-Gaussian algebras for real numbers $q$ with its absolute value sufficiently s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f19e799c92399133726ce1c11d373b1e
https://doi.org/10.7900/jot.2017jun28.2167
https://doi.org/10.7900/jot.2017jun28.2167
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total coloring, the $(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::038cd0c7ec2b8cfcfda3ab2f14421e54
http://arxiv.org/abs/1902.08945
http://arxiv.org/abs/1902.08945
Autor:
Anthony Genevois
In this article, we associate to isometries of CAT(0) cube complexes specific subspaces, referred to as \emph{median sets}, which play a similar role as minimising sets of semisimple isometries in CAT(0) spaces. Various applications are deduced, incl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf7bdc2c74cb929904ae4717343489ea
http://arxiv.org/abs/1902.04883
http://arxiv.org/abs/1902.04883