Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Dara Zirlin"'
Publikováno v:
Pure and Applied Mathematics Quarterly. 18:2479-2509
Publikováno v:
Journal of Combinatorial Theory, Series B. 145:450-465
We find Dirac-type sufficient conditions for a hypergraph H with few edges to be hamiltonian. We also show that these conditions guarantee that H is super-pancyclic, i.e., for each A ⊆ V ( H ) with | A | ≥ 3 , H contains a Berge cycle with vertex
Let $F$ and $H$ be $k$-uniform hypergraphs. We say $H$ is $F$-saturated if $H$ does not contain a subgraph isomorphic to $F$, but $H+e$ does for any hyperedge $e\not\in E(H)$. The saturation number of $F$, denoted $\mathrm{sat}_k(n,F)$, is the minimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfcce58fe4c3ec9b36cfc89a178ad1eb
http://arxiv.org/abs/2202.07149
http://arxiv.org/abs/2202.07149
Publikováno v:
Graphs and Combinatorics. 36:491-501
The k-deck of a graph is the multiset of its subgraphs induced by k vertices. A graph or graph property is l-reconstructible if it is determined by the deck of subgraphs obtained by deleting l vertices. We show that the degree list of an n-vertex gra
Publikováno v:
Kostochka, A V, Raspaud, A, Toft, B, West, D B & Zirlin, D 2021, ' Cut-edges and regular factors in regular graphs of odd degree ', Graphs and Combinatorics, vol. 37, pp. 199–207 . https://doi.org/10.1007/s00373-020-02242-0
We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\le(2r+1)/3$ that every $(2r+1)$-regular grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c22e8bd16816aafe2d652e0713f7b32f
https://portal.findresearcher.sdu.dk/da/publications/ce7f0168-b68a-4bff-8a6d-0c98b18c8abf
https://portal.findresearcher.sdu.dk/da/publications/ce7f0168-b68a-4bff-8a6d-0c98b18c8abf
A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geq 3$, $\mathcal H$ contains a Berge cycle with base vertex set $A$. We present two natural necessary conditions for a hypergraph to be super-pancyclic,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c0a3c389e7b88beb979b5b0d5850e78
Publikováno v:
European Journal of Combinatorics. 91:103216
A graph is l -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting l vertices. We prove that 3-regular graphs are 2-reconstructible.
Publikováno v:
Discrete & Computational Geometry. 56:693-710
Let $$\mathcal {M}$$M be a finite non-collinear set of points in the Euclidean plane, with the squared distance between each pair of points integral. Considering the points as lying in the complex plane, there is at most one positive square-free inte