Results 11 to 20 of about 73 (73)
Veterinary Dermatology, Volume 34, Issue 3, Page 235-245, June 2023., 2023 Background – Oral and parenteral drug delivery in horses can be difficult. Equine‐specific transdermal drug formulations offer improved ease of treatment; development of such formulations requires a deeper understanding of the structural and chemical tissue barrier of horse skin. Hypothesis/Objectives – To compare the structural composition and barrier
Samuel C. Bizley +3 more
wiley +1 more source
The extremal number of longer subdivisions
Bulletin of the London Mathematical Society, Volume 53, Issue 1, Page 108-118, February 2021., 2021 Abstract For a multigraph F, the k‐subdivision of F is the graph obtained by replacing the edges of F with pairwise internally vertex‐disjoint paths of length k+1. Conlon and Lee conjectured that if k is even, then the (k−1)‐subdivision of any multigraph has extremal number O(n1+1k), and moreover, that for any simple graph F there exists ε>0 such that ...
Oliver Janzer
wiley +1 more source
Polynomial removal lemmas for ordered graphs [PDF]
, 2022 A recent result of Alon, Ben-Eliezer and Fischer establishes an induced removal lemma for ordered graphs. That is, if \(F\) is an ordered graph and \(\varepsilon›0\), then there exists \(\delta_{F}(\varepsilon)›0\) such that every \(n\)-vertex ordered
Tomon, István, Gishboliner, Lior
core +1 more source
Minimizing cycles in tournaments and normalized \(q\)-norms [PDF]
, 2022 Akin to the Erdős-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any \(d\in (0,1]\), among all \(n\)-vertex tournaments with \(d\binom{n}{3}\) many 3-cycles, the number of 4-cycles is asymptotically minimized
Tang, Tianyun, Ma, Jie
core +1 more source
Unavoidable order-size pairs in hypergraphs -- positive forcing density [PDF]
, 2023 Erdős, Füredi, Rothschild and Sós initiated a study of classes of graphs that forbid every induced subgraph on a given number \(m\) of vertices and number \(f\) of edges. Extending their notation to \(r\)-graphs, we write \((n,e) \to_r (m,f)\) if every \(
Axenovich, Maria +3 more
core +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika, Volume 66, Issue 2, Page 422-447, April 2020., 2020 Abstract We study the model Gα∪G(n,p) of randomly perturbed dense graphs, where Gα is any n‐vertex graph with minimum degree at least αn and G(n,p) is the binomial random graph. We introduce a general approach for studying the appearance of spanning subgraphs in this model using absorption.
Julia Böttcher +3 more
wiley +1 more source
On stability of the Hamiltonian index under contractions and closures [PDF]
, 2005 The hamiltonian index of a graph G is the smallest integer k such that the k-th iterated line graph of G is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to
Liming Xiong +6 more
core +1 more source
A note on the k‐domination number of a graph
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 1, Page 205-206, 1990., 1989 The k‐domination number of a graph G = G(V, E), γk(G), is the least cardinality of a set X ⊂ V such that any vertex in VX is adjacent to at least k vertices of X. Extending a result of Cockayne, Gamble and Shepherd [4], we prove that if , n ≥ 1, k ≥ 1 then, , where p is the order of G.
Y. Caro, Y. Roditty
wiley +1 more source
On the discrepancy of coloring finite sets
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 4, Page 825-827, 1990., 1990 Given a subset S of {1, …, n} and a map X : {1, …, n} → {−1, 1}, (i.e. a coloring of {1, …, n} with two colors, say red and blue) define the discrepancy of S with respect to X to be dX(S)=|∑i∈SX(i)| (the difference between the reds and blues on S).
D. Hajela
wiley +1 more source