547 KB0 KB193 KB2025Araujo-Pardo, GabrielaKiss, GyörgyPorupsánszki, Istvánštevilka:3, article p3.05letnik:8str. 1-21DOI:10.26493/2590-9770.1733.dc9COBISSID_HOST:237299715ISSN:2590-9770URN:URN:NBN:SI:doc-L5NKNMDPenFakulteta za matematiko, naravoslovje in informacijske tehnologijeThe art of discrete and applied mathematicscage problemedge-girth-regular graphfinite biaffine planesOn extremal (almost) edge-girth-regular graphs|A k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph forshort, if each of its edges is contained in exactly ? distinct g-cycles. An egr-graph is called extremal for the triple (k,g,?) if it has the smallest possible order. We prove that somegraphs arising from incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphsTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije