skip to main content

Explore Research Products in the NSF-PAR

Title: Monochromatic Subgraphs in Iterated Triangulations
For integers $n\ge 0$, an iterated triangulation $\mathrm{Tr}(n)$ is defined recursively as follows: $\mathrm{Tr}(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $\mathrm{Tr}(n)$ is the plane triangulation obtained from the plane triangulation $\mathrm{Tr}(n-1)$ by, for each inner face $F$ of $\mathrm{Tr}(n-1)$, adding inside $F$ a new vertex and three edges joining this new vertex to the three vertices incident with $F$. In this paper, we show that there exists a 2-edge-coloring of $\mathrm{Tr}(n)$ such that $\mathrm{Tr}(n)$ contains no monochromatic copy of the cycle $C_k$ for any $k\ge 5$. As a consequence, the answer to one of two questions asked by Axenovich et al. is negative. We also determine the radius 2 graphs $H$ for which there exists $n$ such that every 2-edge-coloring of $\mathrm{Tr}(n)$ contains a monochromatic copy of $H$, extending a result of Axenovich et al. for radius 2 trees.  more » « less
Award ID(s):
1954134
NSF-PAR ID:
10220444
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
The Electronic Journal of Combinatorics
Volume:
27
Issue:
4
ISSN:
1077-8926
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ( , Random Structures & Algorithms)
    Abstract

    For graphsGandF, writeif any coloring of the edges ofGwithcolors yields a monochromatic copy of the graphF. Supposeis obtained from a graphSwithsvertices and maximum degreedby subdividing its edgeshtimes (that is, by replacing the edges ofSby paths of lengthh + 1). We prove that there exists a graphGwith no more thanedges for whichholds, provided that. We also extend this result to the case in whichQis a graph with maximum degreedonqvertices with the property that every pair of vertices of degree greater than 2 are distance at leasth + 1 apart. This complements work of Pak regarding the size Ramsey number of “long subdivisions” of bounded degree graphs.

     
    more » « less
  2. ; ( , The Electronic Journal of Combinatorics)
    Let $H$ and $F$ be hypergraphs. We say $H$ {\em contains $F$ as a trace} if there exists some set $S \subseteq V(H)$ such that $H|_S:=\{E\cap S: E \in E(H)\}$ contains a subhypergraph isomorphic to $F$. In this paper we give an upper bound on the number of edges in a $3$-uniform hypergraph that does not contain $K_{2,t}$ as a trace when $t$ is large. In particular, we show that $$\lim_{t\to \infty}\lim_{n\to \infty} \frac{\mathrm{ex}(n, \mathrm{Tr}_3(K_{2,t}))}{t^{3/2}n^{3/2}} = \frac{1}{6}.$$ Moreover, we show $\frac{1}{2} n^{3/2} + o(n^{3/2}) \leqslant \mathrm{ex}(n, \mathrm{Tr}_3(C_4)) \leqslant \frac{5}{6} n^{3/2} + o(n^{3/2})$. 
    more » « less
  3. ; ( , Random Structures & Algorithms)

    An edge‐ordered graph is a graph with a linear ordering of its edges. Two edge‐ordered graphs areequivalentif there is an isomorphism between them preserving the edge‐ordering. Theedge‐ordered Ramsey number redge(H; q) of an edge‐ordered graphHis the smallestNsuch that there exists an edge‐ordered graphGonNvertices such that, for everyq‐coloring of the edges ofG, there is a monochromatic subgraph ofGequivalent toH. Recently, Balko and Vizer proved thatredge(H; q) exists, but their proof gave enormous upper bounds on these numbers. We give a new proof with a much better bound, showing there exists a constantcsuch thatfor every edge‐ordered graphHonnvertices. We also prove a polynomial bound for the edge‐ordered Ramsey number of graphs of bounded degeneracy. Finally, we prove a strengthening for graphs where every edge has a label and the labels do not necessarily have an ordering.

     
    more » « less
  4. ; ; ; ; ; ; ( , Journal of cognitive neuroscience)
    A gr e at d e al of i nt er e st s urr o u n d s t h e u s e of tr a n s cr a ni al dir e ct c urr e nt sti m ul ati o n (t D C S) t o a u g m e nt c o g niti v e tr ai ni n g. H o w e v er, eff e ct s ar e i n c o n si st e nt a cr o s s st u di e s, a n d m et aa n al yti c e vi d e n c e i s mi x e d, e s p e ci all y f o r h e alt h y, y o u n g a d ult s. O n e m aj or s o ur c e of t hi s i n c o n si st e n c y i s i n di vi d u al diff er e n c e s a m o n g t h e p arti ci p a nt s, b ut t h e s e diff er e n c e s ar e r ar el y e x a mi n e d i n t h e c o nt e xt of c o m bi n e d tr ai ni n g/ sti m ul ati o n st u di e s. I n a d diti o n, it i s u n cl e ar h o w l o n g t h e eff e ct s of sti m ul ati o n l a st, e v e n i n s u c c e s sf ul i nt er v e nti o n s. S o m e st u di e s m a k e u s e of f oll o w- u p a s s e s s m e nt s, b ut v er y f e w h a v e m e a s ur e d p erf or m a n c e m or e t h a n a f e w m o nt hs aft er a n i nt er v e nti o n. H er e, w e utili z e d d at a fr o m a pr e vi o u s st u d y of t D C S a n d c o g niti v e tr ai ni n g [ A u, J., K at z, B., B u s c h k u e hl, M., B u n arj o, K., S e n g er, T., Z a b el, C., et al. E n h a n ci n g w or ki n g m e m or y tr ai ni n g wit h tr a n scr a ni al dir e ct c urr e nt sti m ul ati o n. J o u r n al of C o g niti v e N e u r os ci e n c e, 2 8, 1 4 1 9 – 1 4 3 2, 2 0 1 6] i n w hi c h p arti ci p a nts tr ai n e d o n a w or ki n g m e m or y t as k o v er 7 d a y s w hil e r e c ei vi n g a cti v e or s h a m t D C S. A n e w, l o n g er-t er m f oll o w- u p t o a ss es s l at er p erf or m a n c e w a s c o n d u ct e d, a n d a d diti o n al p arti ci p a nt s w er e a d d e d s o t h at t h e s h a m c o n diti o n w a s b ett er p o w er e d. W e a s s e s s e d b a s eli n e c o g niti v e a bilit y, g e n d er, tr ai ni n g sit e, a n d m oti v ati o n l e v el a n d f o u n d si g nifi c a nt i nt er a cti o ns b et w e e n b ot h b as eli n e a bilit y a n d m oti v ati o n wit h c o n diti o n ( a cti v e or s h a m) i n m o d els pr e di cti n g tr ai ni n g g ai n. I n a d diti o n, t h e i m pr o v e m e nt s i n t h e a cti v e c o nditi o n v er s u s s h a m c o n diti o n a p p e ar t o b e st a bl e e v e n a s l o n g a s a y e ar aft er t h e ori gi n al i nt er v e nti o n. ■ 
    more » « less
  5. ; ; ; ( , The Electronic Journal of Combinatorics)
    Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$.  This far-reaching generalization of König's theorem is only known to be true for $r\leq 3$, or when $\nu(H)=1$ and $r\leq 5$.  An equivalent formulation of Ryser's conjecture is that in every $r$-edge coloring of a graph $G$ with independence number $\alpha(G)$, there exists at most $(r-1)\alpha(G)$ monochromatic connected subgraphs which cover the vertex set of $G$.   We make the case that this latter formulation of Ryser's conjecture naturally leads to a variety of stronger conjectures and generalizations to hypergraphs and multipartite graphs.  Regarding these generalizations and strengthenings, we survey the known results, improving upon some, and we introduce a collection of new problems and results. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email