Zobrazeno 1 - 10
of 356
pro vyhledávání: '"Broersma, Hajo"'
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$-vertex connected $r$-uniform hypergraph which contains no member of $\mathcal{F}$ as a subhypergraph
Externí odkaz:
http://arxiv.org/abs/2409.03323
An $r$-graph $H$ is a hypergraph consisting of a nonempty set of vertices $V$ and a collection of $r$-element subsets of $V$ we refer to as the edges of $H$. An $r$-graph $H$ is called linear if any two edges of $H$ intersect in at most one vertex. L
Externí odkaz:
http://arxiv.org/abs/2401.12339
We introduce learning augmented algorithms to the online graph coloring problem. Although the simple greedy algorithm FirstFit is known to perform poorly in the worst case, we are able to establish a relationship between the structure of any input gr
Externí odkaz:
http://arxiv.org/abs/2312.00601
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs, and let $H$ be an $r$-uniform hypergraph. Then $H$ is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$ as a subhypergraph. The Tur\'{a}n number of $\mathcal{F}$, de
Externí odkaz:
http://arxiv.org/abs/2306.12463
The $k$-th Laplacian spectral moment of a digraph $G$ is defined as $\sum_{i=1}^n \lambda_i^k$, where $\lambda_i$ are the eigenvalues of the Laplacian matrix of $G$ and $k$ is a nonnegative integer. For $k=2$, this invariant is better known as the La
Externí odkaz:
http://arxiv.org/abs/2305.06362
Publikováno v:
Discrete Mathematics, 345 (2022), 113112
We partly confirm a Brualdi-Solheid-Tur\'{a}n type conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erd\H{o}s-S\'os Conjecture that any tree of order $t$ is contained in a graph of average degree greater than $t-2$.
Externí odkaz:
http://arxiv.org/abs/2112.13253
Publikováno v:
Journal of Graph Theory (2024)
Given two graphs $G, H$ and a positive integer $q$, an $(H,q)$-coloring of $G$ is an edge-coloring of $G$ such that every copy of $H$ in $G$ receives at least $q$ distinct colors. The bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function $r(K_{n,n}, K_{s,t},
Externí odkaz:
http://arxiv.org/abs/2111.00879
Publikováno v:
In Discrete Applied Mathematics 15 November 2024 357:241-257