16 citations · 20 across the 10 of their papers we have counts for
11 papers
Totally bounded ultrametric spaces generated by labeled rays
Oleksiy Dovgoshey, Valentino Vito
We will say that an infinite tree is almost a ray if is the union of a ray and a finite tree. Let be a non-degenerate labeling of the vertex set of almost a ray …
Adaptive Monte Carlo Search for Conjecture Refutation in Graph Theory
Valentino Vito, Lim Yohanes Stefanus
Graph theory is an interdisciplinary field of study that has various applications in mathematical modeling and computer science. Research in graph theory depends on the creation of…
Multimodal SuperCon: Classifier for Drivers of Deforestation in Indonesia
Bella Septina Ika Hartanti, Valentino Vito, Aniati Murni Arymurthy +1
Deforestation is one of the contributing factors to climate change. Climate change has a serious impact on human life, and it occurs due to emission of greenhouse gases, such as ca…
An Asymmetric Contrastive Loss for Handling Imbalanced Datasets
Valentino Vito, Lim Yohanes Stefanus
Contrastive learning is a representation learning method performed by contrasting a sample to other similar samples so that they are brought closely together, forming clusters in t…
A note on increasing paths in countable hypergraphs
Valentino Vito
An old result of Müller and Rödl states that a countable graph has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of by positive…
Peg solitaire and Conway's soldiers on infinite graphs
Valentino Vito
Peg solitaire is classically a one-player game played on a grid board containing pegs. The goal of the game is to have a single peg remaining on the board by sequentially jumping w…
Infinite Ramsey-minimal graphs for star forests
Fawwaz Fakhrurrozi Hadiputra, Valentino Vito
For graphs , , and , we write if every red-blue coloring of the edges of produces a red copy of or a blue copy of . The graph is said to be $(…
On Ramsey-minimal infinite graphs
Jordan Mitchell Barrett, Valentino Vito
For fixed finite graphs , , a common problem in Ramsey theory is to study graphs such that , i.e. every red-blue coloring of the edges of produces either…
Two types of size Ramsey numbers for matchings of small order
Valentino Vito, Denny Riama Silaban
For simple graphs and , their size Ramsey number is the smallest possible size of such that for any red-blue coloring of its edges, contains either a…
Some notes on diagram chasing and diagrammatic proofs in category theory
Valentino Vito
Diagram chasing is a customary proof method used in category theory and homological algebra. It involves an element-theoretic approach to show that certain properties hold for a co…
On functor-quotients and their isomorphism theorems
Jordan Mitchell Barrett, Valentino Vito
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more gene…