Zobrazeno 1 - 10
of 2 144
pro vyhledávání: '"P. Hadwiger"'
Autor:
Campbell, Rutger, Davies, James, Distel, Marc, Frederickson, Bryce, Gollin, J. Pascal, Hendrey, Kevin, Hickingbotham, Robert, Wiederrecht, Sebastian, Wood, David R., Yepremyan, Liana
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say that a graph
Externí odkaz:
http://arxiv.org/abs/2410.19295
Publikováno v:
Geombinatorics Quarterly 33 (2024) 97-106
There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic number of a
Externí odkaz:
http://arxiv.org/abs/2411.05931
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.
Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the \emph{balanced ch
Externí odkaz:
http://arxiv.org/abs/2308.01242
Autor:
Lu, Hsueh-I
Since Jacobson [FOCS89] initiated the investigation of succinct graph encodings 35 years ago, there has been a long list of results on balancing the generality of the class, the speed, the succinctness of the encoding, and the query support. Let Cn d
Externí odkaz:
http://arxiv.org/abs/2307.01500
Hadwiger's Conjecture asserts that every $K_h$-minor-free graph is properly $(h-1)$-colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with monochromatic co
Externí odkaz:
http://arxiv.org/abs/2306.06224
Autor:
Uhrik, Dávid
We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number and the unc
Externí odkaz:
http://arxiv.org/abs/2212.02169
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.
Autor:
Knoerr, Jonas
We give a characterization of smooth, rotation and dually epi-translation invariant valuations and use this result to obtain a new proof of the Hadwiger theorem on convex functions. We also give a description of the construction of the functional int
Externí odkaz:
http://arxiv.org/abs/2209.05158
Autor:
Blagojević, Pavle V. M., Loperena, Jaime Calles, Crabb, Michael C., Blagojević, Aleksandra S. Dimitrijević
In this paper, motivated by recent work of Schnider and Axelrod-Freed \& Sober\'on, we study an extension of the classical Gr\"unbaum--Hadwiger--Ramos mass partition problem to mass assignments. Using the Fadell--Husseini index theory we prove that f
Externí odkaz:
http://arxiv.org/abs/2208.00666