summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorChris Wells <chris@mathematicaster.org>2025-04-08 08:45:19 -0500
committerChris Wells <chris@mathematicaster.org>2025-04-08 08:45:19 -0500
commitb8aac63f4f1d8a1d451e2f6d13efb3f896e5767e (patch)
tree7722ad7176fc5db28c334bb773bf1087fecc9360
parent42b8fce296b762f9fe39ce8c2aca255d28c6cf4d (diff)
downloadcv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar.gz
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar.bz2
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar.lz
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar.xz
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.tar.zst
cv-b8aac63f4f1d8a1d451e2f6d13efb3f896e5767e.zip
New papers published
-rw-r--r--content/papers.bib41
1 files changed, 25 insertions, 16 deletions
diff --git a/content/papers.bib b/content/papers.bib
index be92fa6..1971714 100644
--- a/content/papers.bib
+++ b/content/papers.bib
@@ -1,14 +1,3 @@
-@unpublished{briggs_vietoris,
- title = {Facets in the {V}ietoris--{R}ips complexes of hypercubes},
- author = {Briggs, Joseph and Feng, Ziqin},
- month = {aug},
- year = {2024},
- eprint = {2408.01288},
- eprinttype = {arXiv},
- eprintclass = {math.AT},
- keywords = {submitted},
-}
-
@unpublished{briggs_frogs,
title = {Frogs, hats and common subsequences},
author = {Briggs, Joseph and Parker, Alex and Schwieder, Coy},
@@ -32,16 +21,36 @@
keywords = {submitted},
}
-@unpublished{heath_oddcycles,
+@article{briggs_vietoris,
+ author = {Briggs, Joseph and Feng, Ziqin and Wells, Chris},
+ doi = {10.1080/10586458.2025.2474034},
+ journal = {Experimental Mathematics},
+ month = {3},
+ pages = {1--9},
+ publisher = {Informa UK Limited},
+ title = {Facets in the {V}ietoris\textendash{}{R}ips Complexes of Hypercubes},
+ year = {2025},
+ keywords = {published},
+ eprint = {2408.01288},
+ eprinttype = {arXiv},
+ eprintclass = {math.AT},
+}
+
+@article{heath_oddcycles,
author = {Heath, Emily and Martin, Ryan R.},
+ doi = {10.1002/jgt.23197},
+ journal = {Journal of Graph Theory},
+ month = {4},
+ pages = {745--780},
+ publisher = {Wiley},
title = {The maximum number of odd cycles in a planar graph},
- year = {2023},
- month = {Jul},
+ volume = {108},
+ year = {2025},
+ keywords = {published},
eprint = {2307.00116},
eprintclass = {math.CO},
eprinttype = {arxiv},
- keywords = {accepted},
- journal = {Journal of Graph Theory},
+ % issue = {4},
}
@article{sipp,