6 citations · 9 across the 8 of their papers we have counts for
9 papers
Well-order a flame
Zsuzsanna Jankó, Attila Joó
An -rooted (possibly infinite) digraph is a flame if for every there exists a set of edge-disjoint paths from to in that cove…
Large flames in rooted acyclic digraphs without backward-infinite paths
Attila Joó, Qiuzhenyu Tao
An -rooted digraph is a flame if for each non-root vertex , there is a set of edge-disjoint directed paths from to that covers all ingoing edges of . The study of…
Time-resolved protoplanetary disk physics in DQ Tau with JWST
Á. Kóspál, P. Ábrahám, V. V. Akimkin +17
Accretion variability is ubiquitous in YSOs. While large outbursts may strongly affect the disk, the effects of moderate bursts are less understood. We aim to study the physical re…
A structure theorem for rooted connectivity in bidirected graphs
Tara Abrishami, Nathan Bowler, Attila Joó +2
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization…
Wild generalised truncation of infinite matroids
J. Pascal Gollin, Attila Joó
For , the -truncation of a matroid of rank at least is the matroid whose bases are the -element independent sets of . One can extend this defin…
Hindrance from a wasteful common independent set
Attila Joó
For (potentially infinite) matroids and , an -hindrance is a set that is independent but not spanning in . This concept was introdu…
Gaia20bdk -- a new FUor in Sh 2-301 Star Forming Region
M. Siwak, Á. Kóspál, P. Ábrahám +28
Context. We analyse multi-colour photometric and spectroscopic observations of a Young Stellar Object Gaia20bdk. Aims. We aim to investigate the exact nature of the eruptive phenom…
Circuit-partition of infinite matroids
Nathan Bowler, Attila Joó
Komjáth, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in th…
On Connected Strongly-Proportional Cake-Cutting
Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi +1
We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize t…