<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Even maps, the Colin de Verdière number and representations of graphs</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Vojtech</namePart>
  <namePart type="family">Kaluza</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-2512-8698</description></name>
<name type="personal">
  <namePart type="given">Martin</namePart>
  <namePart type="family">Tancer</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">38AC689C-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-1191-6714</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">UlWa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.
Equality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2022</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Combinatorica</title></titleInfo>
  <identifier type="issn">0209-9683</identifier>
  <identifier type="arXiv">1907.05055</identifier>
  <identifier type="ISI">000798210100003</identifier><identifier type="doi">10.1007/s00493-021-4443-7</identifier>
<part><detail type="volume"><number>42</number></detail><extent unit="pages">1317-1345</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ista>Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 42, 1317–1345.</ista>
<mla>Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4443-7&quot;&gt;10.1007/s00493-021-4443-7&lt;/a&gt;.</mla>
<apa>Kaluza, V., &amp;#38; Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4443-7&quot;&gt;https://doi.org/10.1007/s00493-021-4443-7&lt;/a&gt;</apa>
<chicago>Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” &lt;i&gt;Combinatorica&lt;/i&gt;. Springer Nature, 2022. &lt;a href=&quot;https://doi.org/10.1007/s00493-021-4443-7&quot;&gt;https://doi.org/10.1007/s00493-021-4443-7&lt;/a&gt;.</chicago>
<ama>Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. &lt;i&gt;Combinatorica&lt;/i&gt;. 2022;42:1317-1345. doi:&lt;a href=&quot;https://doi.org/10.1007/s00493-021-4443-7&quot;&gt;10.1007/s00493-021-4443-7&lt;/a&gt;</ama>
<ieee>V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations of graphs,” &lt;i&gt;Combinatorica&lt;/i&gt;, vol. 42. Springer Nature, pp. 1317–1345, 2022.</ieee>
<short>V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>10335</recordIdentifier><recordCreationDate encoding="w3cdtf">2021-11-25T13:49:16Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-10-09T20:53:51Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
