On extremal (almost) edge-girth-regular graphsAraujo-Pardo, Gabriela (Avtor) Kiss, György (Avtor) Porupsánszki, István (Avtor) edge-girth-regular graphcage problemfinite biaffine planesA k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph for short, if each of its edges is contained in exactly λ distinct g-cycles. An egr-graph is called extremal for the triple (k, g, λ) if has the smallest possible order. We prove that some graphs arising from incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphs.Založba Univerze na Primorskem20252025-11-03 12:38:20Članek v reviji22078UDK: 519.17eISSN: 2590-9770DOI: 10.26493/2590-9770.1733.dc9sl