Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Marija Jelic"'
We continue the study of the $k$-cut complex $\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\'c Milutinovi\'c, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2): 1630--1675 (20
Externí odkaz:
http://arxiv.org/abs/2407.08158
Autor:
Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Rowlands, Rowan, Sundaram, Sheila, Xue, Lei
Publikováno v:
SIAM J. on Discrete Mathematics,Vol. 38 (2), 1630--1675 (2024)
We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a graph com
Externí odkaz:
http://arxiv.org/abs/2304.13675
Autor:
Marija Jelic
Publikováno v:
Sfera Politicii, Vol 19, Iss 164 (10), Pp 96-101 (2011)
In the following article you will be able to see how the violence among youth is manifested in society and the causes for the occurrence of aggression and violence. Aggression in children is evolving from an early age, later it increases in school an
Externí odkaz:
https://doaj.org/article/e4c591ce688b4f56af5362bcb8c409d3
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with even cycles i
Externí odkaz:
http://arxiv.org/abs/2211.12559
Autor:
Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Rowlands, Rowan, Sundaram, Sheila, Xue, Lei
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the homotopy t
Externí odkaz:
http://arxiv.org/abs/2209.13503
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times m\times n}
Externí odkaz:
http://arxiv.org/abs/2209.02803
Autor:
Dusan Sokolovic, Boris Djinjdjic, Marija Jelic, Nevena Lecic, Dragan Jovovic, Biljana Jovovic, Zoran Damnjanovic, Ruzica Jankovic, Goran Damnjanovic, Dimitrios Koutsonanos
Publikováno v:
Acta Medica Medianae, Vol 45, Iss 4, Pp 28-31 (2006)
Adhesive molecules play an important role in developing and progression of coronary atherosclerosis. The aim of the paper was to analyze a soluble form of vascular cell adhesive molecules 1 and intracellular cell adhesive molecules 1 in patients with
Externí odkaz:
https://doaj.org/article/2c5d064cd22846eeac35df83bc689d21
Autor:
Camacho, Charles, Fernández-Merchant, Silvia, Milutinović, Marija Jelić, Kirsch, Rachel, Kleist, Linda, Matson, Elizabeth Bailey, White, Jennifer
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of a triparti
Externí odkaz:
http://arxiv.org/abs/2108.01032
Autor:
Camacho, Charles, Fernández-Merchant, Silvia, Milutinović, Marija Jelić, Kirsch, Rachel, Kleist, Linda, Matson, Elizabeth Bailey, White, Jennifer
Publikováno v:
J. Graph Theory. 2022; 100: 5-27
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the minimum nu
Externí odkaz:
http://arxiv.org/abs/1910.06963
The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we completely characterize the pairs (graph, matching complex) for which the matc
Externí odkaz:
http://arxiv.org/abs/1906.03328