<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>An Extremal Problem on Rainbow Spanning Trees in Graphs</dc:title><dc:creator>DeVilbiss, M.; Fain, B.; Holmes, A.; Horn, P.; Mafunda, S.; &amp; Perry, K. E.</dc:creator><dc:corporate_author/><dc:editor/><dc:description/><dc:publisher/><dc:date>2023-01-01</dc:date><dc:nsf_par_id>10421712</dc:nsf_par_id><dc:journal_name>The Australasian journal of combinatorics</dc:journal_name><dc:journal_volume>86</dc:journal_volume><dc:journal_issue>1</dc:journal_issue><dc:page_range_or_elocation>1-23</dc:page_range_or_elocation><dc:issn>2202-3518</dc:issn><dc:isbn/><dc:doi>https://doi.org/</dc:doi><dcq:identifierAwardId>2015425</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>