University of Novi Sad

output

20022026

most citedVariational Problems with Fractional Derivatives: Euler-Lagrange Equations

166 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

24 papers · 1 filter

math.CO2025

Seeing is not believing in limited visibility cops and robbers

Bojan Bašić, Alfie Davies, Aleksa Džuklevski +2

We consider the model of limited visibility Cops and Robbers, where the cops can only see within their $l$ -neighbourhood. We prove that the number of cops needed to see the robber…

math.CO2024★ 1 cited

Semirigidity and the enumeration of nilpotent semigroups of index three

Igor Dolinka, D. G. FitzGerald, James D. Mitchell

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpoten…

math.CO2024

Graphs with span 1 and shortest optimal walks

Tanja Dravec, Mirjana Mikalački, Andrej Taranenko

A span of a given graph $G$ is the maximum distance that two players can keep at all times while visiting all vertices (edges) of $G$ and moving according to certain rules, that pr…

math.CO2024

Generalized saturation game

Balázs Patkós, Miloš Stojaković, Jelena Stratijev +1

We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the comple…

math.CO2023★ 3 cited

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics

Goyal Keshav, Duc Tu Dao, Han Mao Kiah +1

Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these t…

math.CO2021★ 1 cited

Lattice Packings of Cross-polytopes from Reed-Solomon Codes and Sidon Sets

Mladen Kovačević

Two constructions of lattice packings of $n$ -dimensional cross-polytopes ( $ℓ_{1}$ balls) are described, the density of which exceeds that of any prior construction by a factor…

math.CO2021

Enumeration of Hamiltonian Cycles on a Thick Grid Cylinder -- Part II: Contractible Hamiltonian Cycles

Olga Bodroža-Pantić, Harris Kwong, Jelena Djokić +2

In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m + 1} \times C_{n}$ , where $n$ is allowed to grow whilst $m$ is fix…

math.CO2020★ 7 cited

Maker-Breaker total domination game on cubic graphs

Jovana Forcan, Mirjana Mikalački

We study Maker--Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing the role of Maker) wins if she manages t…

math.CO2020★ 5 cited

Maker-Breaker domination number for Cartesian products of path graphs $P_{2}$ and $P_{n}$

Jovana Forcan, Jiayue Qi

We study the Maker-Breaker domination game played by Dominator and Staller on the vertex set of a given graph. Dominator wins when the vertices he has claimed form a dominating set…

math.CO2020★ 2 cited

Fast Strategies in Waiter-Client Games on $K_{n}$

Dennis Clemens, Pranshu Gupta, Fabian Hamann +3

Waiter-Client games are played on some hypergraph $(X, F)$ , where $F$ denotes the family of winning sets. For some bias $b$ , during each round of such a game Wai…

math.CO2018

On a family of highly regular graphs by Brouwer, Ivanov, and Klin

Christian Pech, Maja Pech

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W.~Kantor's non-classical $…

math.CO2016★ 1 cited

A brief overview of the sock matching problem

Bojana Pantić, Olga Bodroža-Pantić

This short note deals with the so-called $S oc k M a t c hin g P r o b l e m$ . We define $B_{n, k}$ as the number of all the finite sequences $a_{1}, \dots, a_{2 n}$ of nonnegative integers…

math.CO2016★ 2 cited

Fast strategies in biased Maker--Breaker games

Mirjana Mikalački, Miloš Stojaković

We study the biased $(1 : b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_{n}$ . Given Breaker's bias $b$ , possibly depending on $n…

math.CO2015★ 1 cited

On the Dual Ramsey Property for Finite Distributive Lattices

Dragan Masulovic, Nebojsa Mudrinski

The class of finite distributive lattices, as many other classes of structures in everyday use, does not have the Ramsey property. It is quite common, though, that after expanding…

math.CO2015

Enumeration of idempotents in planar diagram monoids

Igor Dolinka, James East, Athanasios Evangelou +5

We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms…

math.CO2015

A remark on the Tournament game

Dennis Clemens, Mirjana Mikalački

We study the Maker-Breaker tournament game played on the edge set of a given graph $G$ . Two players, Maker and Breaker claim unclaimed edges of $G$ in turns, and Maker wins if by t…

math.CO2014★ 4 cited

Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph

Igor Dolinka, Robert D. Gray, Jillian D. McPhee +2

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$ . As a consequence we show that, for any countable graph…

math.CO2014★ 3 cited

On saturation games

Dan Hefetz, Michael Krivelevich, Alon Naor +1

A graph $G = (V, E)$ is said to be saturated with respect to a monotone increasing graph property $P$ , if $G \in / P$ but $G \cup {e} \in P$ for…

math.CO2014

On the threshold for the Maker-Breaker $H$ -game

Rajko Nenadov, Angelika Steger, Miloš Stojaković

We study the Maker-Breaker $H$ -game played on the edge set of the random graph $G_{n, p}$ . In this game two players, Maker and Breaker, alternately claim unclaimed edges of $G_{n,p}…

math.CO2012

Homomorphism-homogeneous L-colored graphs

David Hartman, Jan Hubicka, Dragan Masulovic

A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homom…

math.CO2011

Doubly biased Maker-Breaker Connectivity game

Dan Hefetz, Mirjana Rakić, Miloš Stojaković

In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge-set of the complete graph on n vertices. We determine the winner for almost all values of a a…

math.CO2010★ 2 cited

Finite irreflexive homomorphism-homogeneous binary relational systems

Dragan Mašulović, Rajko Nenadov, Nemanja Škorić

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Neš…

math.CO2009

On winning fast in Avoider-Enforcer games

János Barát, Miloš Stojaković

We analyze the duration of the unbiased Avoider-Enforcer game for three basic positional games. All the games are played on the edges of the complete graph on $n$ vertices, and Avo…

math.CO2008

Fast winning strategies in Avoider-Enforcer games

Dan Hefetz, Michael Krivelevich, Miloš Stojaković +1

In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\em who} wins but rather {\em how fast} can…